BUFFERS

RELATED APPLICATION

[0001] The present application claims priority to U.S. Pat. App. Ser. No.

16/210,609, filed Dec. 5, 2018 and entitled "Protection against Timing-based

Security Attacks on Re-Order Buffers," the entire disclosure of which is hereby incorporated herein by reference.

FIELD OF THE TECHNOLOGY

[0002] At least some embodiments disclosed herein relate generally to computer architecture and more specifically, but not limited to, techniques to protect against security attacks on re-order buffers.

BACKGROUND

[0003] Instructions are typically programmed to be executed sequentially. A program order of instructions is the order in which the instructions are programmed for execution in a processor.

[0004] It is possible to execute some instructions according to an alternative order and obtain the same result(s) as executing the instructions according to the program order.

[0005] Out-of-order execution have been implemented in some processors to improve the utilization of the processing power of the processors and increase the overall speed of executing a program having a sequence of instructions.

[0006] For example, when the processor is about to process an instruction that is configured to operate on an operand, the operand may be in the process of being loaded from a cache, or a main memory, or a storage device. However, the operand of the next instruction in the program order may be ready for processing in the processor. Thus, the processor may execute the next instruction, instead of pausing the execution of instructions to wait for the operand that is being loaded from the cache, the main memory, or the storage device. [0007] A“data order” of instructions is the order in which the data or operands of the instructions become available in the processor for processing. The data order is typically different from the program order in contemporary processor design. A processor can be configured to execute instructions according to the data order of the instructions, instead of the program order of the instructions.

[0008] A re-order buffer can be used to temporally hold the execution results of instructions that are executed out of their program order. For example, the instructions can be executed in the data order of the instructions. The results stored in the re-order buffer can be moved out of the re-order buffer in the program order of the respective instructions, as if the results were generated by executing the instructions according to the program order. For example, a sequence of 3 instructions can be a first instruction to load an operand A into a first register (e.g., “load A, r1”), a second instruction to load another operand B into a second register (e.g.,“load B, r2”), and a third instruction to add a number to the second register (e.g.,“add #1 , r2”). It is possible to execute the second instruction (e.g.,“load B, r2”) out of order before the execution of the first instruction (e.g.,“load A, r1”), execute the third instruction (e.g.,“add #1 , r2”), and then execute the first instruction (e.g., “load A, r1”). Such an alternative execution sequence can be desirable when the memory system can return the operand B before the operand A. For example, when the data becomes ready in the order of B, #1 , A, the instructions can be executed in the order of“load B, r2”,“add #1 , r2”, and“load A, r1”, which is different from the program order of“load A, r1”,“load B, r2”, and“add #1 , r2”.

[0009] Implementations of out-of-order execution may have security vulnerability. Examples of such security vulnerabilities in computer processors include Meltdown and Spectre that were made public in 2018. For example, security vulnerabilities may allow data to be cached from a privileged security boundary, resulting in a race condition that could be timed to leak privileged information. An example of data in a privileged security boundary is data located in the operating system kernel.

BRIEF DESCRIPTION OF THE DRAWINGS

[0010] The embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements. [0011] FIG. 1 shows a buffer controller configured to protect against timing-based security attacks on a re-order buffer according to one embodiment.

[0012] FIG. 2 shows an out-of-order execution controlled by a buffer capacity controller according to one embodiment.

[0013] FIG. 3 shows a method to protect against timing-based security attacks on re-order buffers according to one embodiment.

[0014] FIG. 4 show a computing system in which the method of FIG. 3 can be implemented.

DETAILED DESCRIPTION

[0015] The present disclosure includes techniques for protection against timing- based security attacks on re-order buffers.

[0016] A timing-based security attack relies upon a timing pattern of results in a re-order buffer. Such an attack can be prevented and/or made difficult to implement by randomizing the timing pattern of results in re-order buffers.

[0017] For example, the timing pattern of results in a re-order buffer can be dependent on the operating capacity of the re-order buffer. The actual/operating capacity of the re-order buffer usable to re-order results of instructions that are executed out of their program order can be changed randomly from time to time such that the timing pattern changes from time to time. Such a capacity adjustment can be performed randomly in time, or periodically, to introduce randomness in the timing of the results in the re-order buffer.

[0018] FIG. 1 shows a buffer controller (115) configured to protect against timing- based security attacks on a re-order buffer (113) according to one embodiment. For example, the buffer controller (115) can be implemented in a processor of a computer system illustrated in FIG. 4.

[0019] In FIG. 1 , the re-order buffer (113) is configured to receive results of instructions in an order in which instructions are executed. The results in the re order buffer (113) can be moved out of the re-order buffer (113) for committing into a register file of a processor (e.g., 181 in FIG. 4), a cache memory of the processor, and/or a memory external to the processor, based on a“graduation order.” The graduation order of the results in the re-order buffer (113) for instructions is the order in which the results of the instructions are committed and the instructions are retired for completion; and the graduation order (retirement order, or commitment order) is typically configured to be consistent with the program order of the instructions. The execution result of an instruction that is to be executed early in the program order is to be graduate from the re-order buffer (113) early. A result of an instruction can be moved out of the re-order buffer (113) for committing when the results of instructions programmed before the instruction in the program order are ready to be moved out of the re-order buffer (113) for committing. In some instances, some instructions can be executed in parallel units, threads or pipelines; and the graduation order

(retirement order, or commitment order) from the re-order buffer (113) preserves sequential consistency. In general, sequential consistency requires that the result of any execution is the same as if the instructions were executed in a sequential order specified by its program. Commitment or committing to a register may be referred to as writing to a register. So results may be committed to a register by a processor configured to write the results to the register.

[0020] The capacity of the re-order buffer (113) determines the depth of a sequence of instructions that can be executed out of order before a result can graduate from the re-order buffer (113). A same set of instructions executed using re-order buffers (e.g., 113) of different capacities can have different timings of results buffering in the re-order buffer (113). Thus, changing the capacity of the re-order buffer (113) can change the pattern of out of order of executions. Randomizing the change in the capacity of the re-order buffer (113) can introduce randomness in data timing in the re-order buffer (113) and thus remove the predictability of timing in the re-order buffer (113) and defeat or prevent timing-based security attacks on the re order buffer (113).

[0021] In some instances, the re-order buffer (113) has a predetermined full capacity. The buffer controller (115) identifies a usable capacity of the re-order buffer (113) for sorting the incoming results (111 ) that are provided in the order of actual execution/completion of instructions. When the usable capacity identified by the buffer controller (115) is reached, the out-of-order execution of instructions beyond the set of instructions for each the re-order buffer (113) can buffer their results is prevented, until some of the results in the re-order buffer graduate from the re-order buffer (113).

[0022] The usable capacity of the re-order buffer (113) can be a random fraction of the predetermined full capacity of the re-order buffer (113). The randomness in usable capacity of the re-order buffer (113) can destroy or weaken the predictability of timing of the re-order buffer (113) and thus protect against timing-based security attack on the re-order buffer (113).

[0023] In some instances, the re-order buffer (113) can have a dynamically allocated amount of capacity for sorting the results in execution order (111 ) into the results in graduation order (117). The buffer controller (115) controls the dynamic allocation of the capacity for the re-order buffer (113) (e.g., based on the output of a random number generator).

[0024] In some instances, multiple processing cores can have multiple re-order buffers (e.g., 113) respectively. A buffer controller (115) can dynamically re-allocate a shared buffer capacity for the multiple re-order buffers (e.g., 113). For example, instead of evenly dividing the shared buffer capacity among the multiple re-order buffers (e.g., 113), the buffer controller (115) can randomize the ratios of capacity allocations among the multiple re-order buffers (e.g., 113) to cause randomness in timing.

[0025] In some instances, the buffer controller (115) re-configures the usable capacity of the re-order buffer (113) periodically at a regular, predetermined time interval. Alternatively, a usable capacity can be configured for the re-order buffer (113) for a random time period of operation; and after the random time period of operation, the usable capacity of the re-order buffer (113) can be reconfigured for another random period of operations. Time periods of operation may be referred to as, e.g., a first period of time and a second period of time following the first period of time. The randomness in the lengths of periods of operation at two or more constant usable capacities can also reduce or destroy the timing predictability in the re-order buffer (113).

[0026] FIG. 2 shows an out-of-order execution controlled by a buffer capacity controller (114) according to one embodiment. For example, the buffer controller (115) of FIG. 1 can be implemented using the buffer capacity controller (114) of FIG. 2 with a random number generator (116) to randomize out-of-order execution of instructions. The random number generator (116) can be configured to prevent an attacker from detecting the sequence of outputs generated from the random number generator (116) and/or its algorithm for generating randomized outputs. For example, statistically random noises on computer busses can be used in the random number generator (116) to prevent an attacker from accurately predicting the outputs of the random number generator (116). Electrical noises in general cannot be modeled accurately. Such stochastic processes are, in theory, completely

unpredictable; and the theory’s assertions of unpredictability are subject to

experimental tests. In general, any techniques for securing a random number generator (116) against attacks can be used. Thus, the present disclosure is not limited to any specific implementations of random number generators.

[0027] In FIG. 2, instructions (101 ) fetched according to the program order of the instructions are buffered in the instruction buffer (103). The instructions (101 ) can be fetched from a cache memory of a processor, from a memory of a computer system, and/or a storage device of the computer system (e.g., as illustrated in FIG. 6).

[0028] The instructions in the instruction buffer (103) can be executed in functional units (109) of the processor when the data/operands (107) of the instructions are available to the functional units.

[0029] In general, some of the data operands (107) of the instructions may be loaded from a cache memory of the processor, from the memory of the computer system, and/or from the storage device of the computer system (e.g., illustrated in FIG. 6). Other data operands (107) of the instructions can be the results of the executions of other instructions. Such results may be available in registers/register files of the processor and/or in the re-order buffer (113).

[0030] Loading certain data items (e.g., from a cache memory, a main memory, or a storage device) can take a time period that is longer than the processing of one or more data-ready instructions. The data/operands (107) of data-ready instructions can be used by the functional units (109) in a short time period. Thus, such data- ready instructions in the instruction buffer (103) can be issued to functional units (109) for execution according to a data order that is different from the program order.

[0031] The functional units (109) generates results (111 ) in an order of

execution/completion of instructions; and the results (111 ) are temporally stored in the re-order buffer (113) for their graduation. A result of each respective instruction can graduate/retire/be committed from the re-order buffer (113) when the results of instructions before the respective instruction are in the re-order buffer (113) and ready for graduation, or have already graduated from the re-order buffer (113).

[0032] Results (117) in the graduation order, which is consistent with the program order of their instructions (101 ), can be moved out of the re-order buffer (113) for committing into registers (register files, a cache, a main memory, and/or a storage device) (119).

[0033] When the capacity of the re-order buffer (112) is fixed, the timing of the results (111 ) in the re-order buffer (112) for a given set of instructions may be predicted, determined, and/or exploited by a security attack to gain unauthorized knowledge about the execution of instructions and/or their data.

[0034] To destroy, reduce, or weaken the predictability of the timing of the results (111 ) entering the re-order buffer (113) and/or the results (117) leaving the re-order buffer (113), the buffer capacity controller (114) can inject randomness in the timing by randomizing the usable capacity of the re-order buffer (113) in sorting the results (111/117).

[0035] For example, the buffer capacity controller (114) can include, or be coupled to, a random number generator (116). The output of the random number generator (116) can be used in the buffer capacity controller (114) to determine a limit of usable portion of the re-order buffer (113) in sorting the results (111/117).

[0036] For example, when a result set graduates from the re-order buffer (113), the buffer capacity controller (114) can determine an adjustment to the usable portion of the re-order buffer (113) in sorting the results (111/117). The adjustment can be made via adding dummy results into the re-order buffer (113), or removing dummy results that have been previously added to the re-order buffer (113). The dummy results added into the front or the back of the queue (or another location) in the re-order buffer (113) effectively reduces the usable portion of the re-order buffer (113) for sorting the results (111/117).

[0037] For example, the output of the random number generator (116) can be converted to a count of dummy results to be kept in the re-order buffer (113) for a next time period of operations of the re-order buffer. The count of dummy results corresponds to a fraction of the full capacity of the re-order buffer (113). If the current count of dummy results in the re-order buffer (113) is larger than the desired count converted from the output of the random number generator (116), the buffer capacity controller (114) removes one or more dummy results from the re-order buffer (113), as if the dummy results were to graduate from the re-order buffer (113). If the current count of dummy results in the re-order buffer (113) is smaller than the desired count converted from the output of the random number generator (116), the buffer capacity controller (114) adds one or more dummy results to the re-order buffer (113) (e.g., in the slots vacated by the results (117) that recently graduate from the re-order buffer (113), as if the dummy results were generated by the functional units (109) as a result of executing dummy instructions.

[0038] Alternatively, the buffer capacity controller (114) can be configured to adjust, according to the random number generator (116), one or more boundaries of the re-order buffer (112) that define the capacity of the buffer capacity controller (114).

[0039] In some instances, the output of the random number generator (115) controls when the buffer capacity controller (114) adjusts the usable capacity of the re-order buffer (113).

[0040] For example, the output of the random number generator (115) can be used to set a threshold count of cycles of operations of the re-order buffer between two successive adjustments. After the threshold count of cycles of operations following a prior adjustment, the buffer capacity controller (114) can adjust again the capacity of the re-order buffer (113).

[0041] Cycles of operations of the re-order buffer can be counted based on a predetermined number of instruction cycles (or clock cycles) of the processor in one embodiment.

[0042] Alternatively, a cycle of operations can be counted as being between two successive graduations of result sets (117) from the re-order buffer (113). In such a situation, the length of the cycle may not be a constant relative to a clock cycle and/or an instruction cycle.

[0043] FIG. 3 shows a method to protect against timing-based security attacks on re-order buffers according to one embodiment. For example, the method of FIG. 3 can be implemented using the buffer controller (115) of FIG. 1 or the buffer capacity controller (114) of FIG. 2.

[0044] At block 131 , a processor (e.g., 181 in FIG. 4) executes instructions in an order that is different from a program order in which the instructions are

programmed.

[0045] For example, the processor can execute the instructions according to a data order in which the data/operands of the instructions are ready in the processor for processing.

[0046] At block 133, the processor buffers execution results (111 ) of the instructions in a re-order buffer (113). [0047] For example, the execution results (111 ) of instructions can enter the re order buffer (113) in an order that is different from the program order of the instructions. For example, first instructions can be programmed to be processed earlier than second instructions; due to out-of-order execution, execution results of the second instructions can arrive in the re-order buffer (113) earlier than the results of first instructions; and in such a situation, the execution results of the second instructions can wait in the re-order buffer (113) until the results of first instructions arrive in the re-order buffer (113), such that the results of the first and second instructions can be provided from the re-order buffer (113) according to the program order of the instructions.

[0048] At block 135, the re-order buffer (113) outputs the results of the

instructions in accordance with the order in which the instructions are programmed.

[0049] At block 137, a controller (e.g., 115 or 114) determines whether to adjust the capacity of the re-order buffer (113).

[0050] For example, the controller (e.g., 115 or 114) can determine at a regular time interval whether to adjust the capacity of the re-order buffer (113).

[0051] For example, the controller (e.g., 115 or 114) can determine whether to adjust the capacity of the re-order buffer (113) when some results can be moved out of the re-order buffer (113) for graduation according to the program order.

[0052] For example, the controller (e.g., 115 or 114) can determine whether to adjust the capacity of the re-order buffer (113) when more than a threshold number of results can be moved out of the re-order buffer (113) for graduation according to the program order.

[0053] For example, the controller (e.g., 115 or 114) can determine whether to adjust the capacity of the re-order buffer (113) when more than a threshold number of batches of results have been moved out of the re-order buffer (113) for graduation according to the program order.

[0054] At block 139, if the controller (e.g., 115 or 114) decides to adjust the capacity of the re-order buffer (113), the controller (e.g., 115 or 114) determines an adjustment to the capacity of the re-order buffer (113) according to an output from a random number generator (116).

[0055] For example, the controller (e.g., 115 or 114) can decide to increase or decrease the capacity of the re-order buffer (113) by a random amount calculated based on the output of the random number generator (116). [0056] In some instances, the controller (e.g., 115 or 114) can decide to increase or decrease the capacity of the re-order buffer (113) (e.g., by a predetermined amount) at a randomized time instance controlled by the random number generator (116).

[0057] Optionally, the controller (e.g., 115 or 114) can decide to increase or decrease the capacity of the re-order buffer (113) at a random time controlled by a random amount.

[0058] At block 141 , the controller (e.g., 115 or 114) implements the randomized adjustment to the capacity of the re-order buffer (113).

[0059] For example, the controller (e.g., 115 or 114) can adjust the number of dummy results inserted in the re-order buffer (113) to control the useful capacity of the re-order buffer (113) in sorting results.

[0060] For example, the controller (e.g., 115 or 114) can adjust the boundaries of the re-order buffer (113) to control the useful capacity of the re-order buffer (113) in sorting results.

[0061] For example, the controller (e.g., 115 or 114) can re-partition a set of memory cells configured for multiple re-order buffers (e.g., 113) to adjust their capacities, including the capacity of the re-order buffer (113).

[0062] FIG. 4 show a computing system in which the method of FIG. 3 can be implemented.

[0063] The computing system of FIG. 4 can include a processor (181 ) having an internal cache (191 ), a memory device (187), an external cache (193), and a storage device (189) that is connected to the processor (181 ) and/or the memory (187) via an interconnect (185).

[0064] For example, the processor (181 ) can have functional units (109) to execute instructions. The processor (181 ) can further include registers (153) to contain memory addresses, data/operands of instructions to be executed in the functional units (109), and/or execution results of the instructions.

[0065] For example, the registers (153) can include a program counter for loading instructions for execution, and a memory address register. When an instruction is being executed in the processor (181 ), the memory address stored in the memory address register can be used to load an operand of the instruction, and/or store a computing result generated from executing the instruction. [0066] The processor (181 ) can execute instructions out of their program order and make the results of instructions available in the program order using the re-order buffer (113).

[0067] The processor (181 ) has a controller (151 ) that is configured to cause randomness in timing of results entering and/or leaving the re-order buffer (113). For example, the randomness can be implemented via randomized adjustments to the useful capacity of the re-order buffer (113), using any of the techniques discussed above in connection with FIGS. 1 - 3. For example, the controller (151 ) can be configured as the buffer controller (115) of FIG. 1 , or the buffer capacity controller (114) of FIG. 2, to randomize data timing in the re-order buffer (113) using a method of FIG. 3.

[0068] The randomizing techniques discussed above can cause the usages of the re-order buffer (113) to be different for each execution of a same program. One of the consequences of the use of the techniques is that for multiple executions of the same program with the same data set under exactly the same computation conditions (same number of users, same amount of physical memory, etc.) the execution time of the program can be different. In many cases, this arrangement by itself can be highly secure against timing attacks.

[0069] For example, one of the more publicize security attacks was to determine a cryptographical key, based on timing. When the timing is just one or two cycles different for execution instances, a large body of such attacks can be rendered useless on computer systems having reorder buffers configured in ways discussed in the present disclosure.

[0070] For example, the processor (161 ) can issue instructions to the functional units (109) from the internal cache (191 ) (e.g., an instruction buffer (103)) when the data/operands of the instruction are available in the internal cache (191 ), the registers (153), and/or the re-order buffer (113). The processor (161 ) buffers the execution results of the instructions generated by the functional units (109) for graduation in accordance with the program order of the instructions. The processor (161 ) can move the results from the re-order buffer (113) in the program order to registers (153), the internal cache (191 ), the external cache (193), the memory device (187), and/or the storage device (189).

[0071] In some instances, the addresses used the registers of the processor (181 ) are virtual memory addresses; and a memory management unit (MMU) (183) can convert the virtual memory addresses to physical memory addresses to access the external cache (193), the memory device (187), and/or the storage device (189).

[0072] For example, the data in the memory device (187) can be cached in the external cache (193) of the processor (181 ) and/or the internal cache (191 ) of the processor (181 ).

[0073] For example, the data in the external cache (193) can be cached in the internal cache (191 ).

[0074] For example, the data in the storage device (189) can be cached in the memory device (187), in the external cache (193), and/or in the internal cache (191 ).

[0075] In some instances, the memory management unit (MMU) (183) controls the data movement among the internal cache (191 ), the external cache (193), and the memory device (198).

[0076] The techniques disclosed herein can be applied to at least to computer systems where processors are separated from memory and processors

communicate with memory and storage devices via communication buses and/or computer networks. Further, the techniques disclosed herein can be applied to computer systems in which processing capabilities are integrated within

memory/storage. For example, the processing circuits, including executing units and/or registers of a typical processor, can be implemented within the integrated circuits and/or the integrated circuit packages of memory media to performing processing within a memory device. Thus, a processor (e.g., 101 ) as discussed above and illustrated in the drawings is not necessarily a central processing unit in the von Neumann architecture. The processor can be a unit integrated within memory to overcome the von Neumann bottleneck that limits computing

performance as a result of a limit in throughput caused by latency in data moves between a central processing unit and memory configured separately according to the von Neumann architecture.

[0077] The description and drawings of the present disclosure are illustrative and are not to be construed as limiting. Numerous specific details are described to provide a thorough understanding. Flowever, in certain instances, well known or conventional details are not described in order to avoid obscuring the description. References to one or an embodiment in the present disclosure are not necessarily references to the same embodiment; and, such references mean at least one. [0078] In the foregoing specification, the disclosure has been described with reference to specific exemplary embodiments thereof. It will be evident that various modifications can be made thereto without departing from the broader spirit and scope as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense.