Tracking load store ordering hazards
AssigneeInternational Business Machines Corporation
InventorEric F. ROBINSON
Life of this patent
Estimating the term…
Abstract
A method and system for processing data. In one embodiment, the method includes receiving a plurality of stores into a store queue, where each store is a result from a processor, and where the plurality of stores are destined for at least one memory address. The method also includes marking a most recent store of the plurality of stores for each unique memory address, comparing a load request against the store queue, and identifying only the most recent store for each unique memory address for the purpose of handling load-hit-store ordering hazards.
Claims19
A method comprising:
- receiving a plurality of stores into a store queue, wherein each store is a result from a processor, and wherein the plurality of stores are destined for at least one memory address;
- marking a most recent store of the plurality of stores for each unique memory address;
- comparing a load request against the store queue;
- and
- identifying only the most recent store for each unique memory address.
A computer-readable medium containing program instructions which when executed by a computer system cause the computer system to execute a method comprising:
- receiving a plurality of stores into a store queue, wherein each store is a result from an execution unit, and wherein the plurality of stores are destined for at least one memory address;
- marking a most recent store of the plurality of stores for each unique memory address;
- comparing a load request against the store queue;
- and
- identifying only the most recent store for each unique memory address.
A system comprising:
- a processor;
- a store queue for the processor, wherein the processor is operable to:
- receive a plurality of stores into a store queue, wherein each store is a result from an execution unit, and wherein the plurality of stores are destined for at least one memory address;
- mark a most recent store of the plurality of stores for each unique memory address;
- compare a load request against the store queue;
- and
- identify only the most recent store for each unique memory address.
Dependencies are inferred from the claim text.