Speculatively performing memory move requests with respect to a barrier
AssigneeInternational Business Machines Corporation
InventorsGUY L. GUTHRIE, DEREK E. WILLIAMS
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsGUY L. GUTHRIE, DEREK E. WILLIAMS
Estimating the term…
A lower level cache receives, from a processor core, a plurality of copy-type requests and a plurality of paste-type requests that together indicate a memory move to be performed, as well as a barrier request that requests ordering of memory access requests prior to and after the barrier request. The barrier request precedes a copy-type request and a paste-type request of the memory move in program order. Prior to completion of processing of the barrier request, the lower level cache allocates first and second state machines to service the copy-type and paste-type requests. The first state machine speculatively reads a data granule identified by a source real address of the copy-type request into a non-architected buffer. After processing of the barrier request is complete, the second state machine writes the data granule from the non-architected buffer to a storage location identified by a destination real address of the paste-type request.
A method of data processing in a data processing system implementing a weak memory model, wherein the data processing system includes an interconnect fabric and a processor core having a store-through upper level cache and a store-in lower level cache, the method comprising:
A processing unit for a data processing system implementing a weak memory model, wherein the data processing system includes an interconnect fabric, the processing unit comprising:
A design structure tangibly embodied in a computer-readable storage device for designing, manufacturing, or testing an integrated circuit, the design structure comprising:
Dependencies are inferred from the claim text.