Patent application number | Description | Published |
20090282225 | STORE QUEUE - Embodiments of the present invention provide a system which executes a load instruction or a store instruction. During operation the system receives a load instruction. The system then determines if an unrestricted entry or a restricted entry in a store queue contains data that satisfies the load instruction. If not, the system retrieves data for the load instruction from a cache. If so, the system conditionally forwards data from the unrestricted entry or the restricted entry by: (1) forwarding data from an unrestricted entry that contains the youngest store that satisfies the load instruction when any number of unrestricted or restricted entries contain data that satisfies the load instruction; (2) forwarding data from an unrestricted entry when only one restricted entry and no unrestricted entries contain data that satisfies the load instruction; and (3) deferring the load instruction by placing the load instruction in a deferred queue when two or more restricted entries and no unrestricted entries contain data that satisfies the load instruction. | 11-12-2009 |
20090300338 | AGGRESSIVE STORE MERGING IN A PROCESSOR THAT SUPPORTS CHECKPOINTING - Embodiments of the present invention provide a processor that merges stores in an N-entry first-in-first-out (FIFO) store queue. In these embodiments, the processor starts by executing instructions before a checkpoint is generated. When executing instructions before the checkpoint is generated, the processor is configured to perform limited or no merging of stores into existing entries in the store queue. Then, upon detecting a predetermined condition, the processor is configured to generate a checkpoint. After generating the checkpoint, the processor is configured to continue to execute instructions. When executing instructions after the checkpoint is generated, the processor is configured to freely merge subsequent stores into post-checkpoint entries in the store queue. | 12-03-2009 |
20100299482 | METHOD AND APPARATUS FOR DETERMINING CACHE STORAGE LOCATIONS BASED ON LATENCY REQUIREMENTS - A method for determining whether to store binary information in a fast way or a slow way of a cache is disclosed. The method includes receiving a block of binary information to be stored in a cache memory having a plurality of ways. The plurality of ways includes a first subset of ways and a second subset of ways, wherein a cache access by a first execution core from one of the first subset of ways has a lower latency time than a cache access from one of the second subset of ways. The method further includes determining, based on a predetermined access latency and one or more parameters associated with the block of binary information, whether to store the block of binary information into one of the first set of ways or one of the second set of ways. | 11-25-2010 |
20110276791 | HANDLING A STORE INSTRUCTION WITH AN UNKNOWN DESTINATION ADDRESS DURING SPECULATIVE EXECUTION - The described embodiments provide a system for executing instructions in a processor. While executing instructions in an execute-ahead mode, the processor encounters a store instruction for which a destination address is unknown. The processor then defers the store instruction. Upon encountering a load instruction while the store instruction with the unknown destination address is deferred, the processor determines if the load instruction is to continue executing. If not, the processor defers the load instruction. Otherwise, the processor continues executing the load instruction. | 11-10-2011 |
Patent application number | Description | Published |
20140129404 | Session-Based Electronic Trading - An electronic trading method, system, apparatus and platform that facilitate dealer to client trading of financial instruments in a session-based format. In one embodiment, the electronic trading system establishes a trading session for a given financial instrument at a predetermined date and time. The electronic trading system presents a two-sided market and provides a guarantee of a minimum liquidity for the trading session. The electronic trading system then executes client orders based on time of order entry and allocation of available liquidity. | 05-08-2014 |
20140129405 | Session-Based Electronic Trading And Order Handling - A session based electronic trading and order handling system and method include order handling protocols for processing and distributing order information. In one embodiment, the order handling system receives an order to trade in a financial instrument. The order handling system obtains an order handling rule for communicating certain order attributes to a party and applies the order handling rule to the order to communicate such attributes. | 05-08-2014 |
20140129406 | Session-Based Electronic Trading Providing Price Improvement - An electronic trading method and system to facilitate order execution at improved prices. In one embodiment, the electronic trading system includes a price improvement module that determines, from aggregated orders, total orders on each trade side. The price improvement module further determines whether an amount of two-sided order interest is at least a predefined amount, and if so, generates an indication to execute one or more of the orders at an improved bid price or an improved ask price. | 05-08-2014 |
20140129407 | Order Fulfillment Method And System - A method and system for filling orders based on time of order entry and liquidity allocation are disclosed. A trading system having an order fulfillment engine, receives orders to trade a financial instrument. Each order may specify an order size and a trade side. The system identifies a trade side with aggregate order size larger than that of an opposing trade side and determines a priority for executing orders on the identified trade side based on available liquidity and time of order entry. The one or more orders on the identified trade side are then executed according to the determined priority. | 05-08-2014 |