| US 7,512,747 B2 | ||
| Method and apparatus for efficiently supporting multiple one-time table access operations in a hierarchical memory setting | ||
| Bishwaranjan Bhattacharjee, Yorktown Heights, N.Y. (US); Christian Alexander Lang, New York, N.Y. (US); and Timothy Ray Malkemus, Round Rock, Tex. (US) | ||
| Assigned to International Business Machines Corporation, Armonk, N.Y. (US) | ||
| Filed on Apr. 14, 2006, as Appl. No. 11/404,966. | ||
| Prior Publication US 2007/0245079 A1, Oct. 18, 2007 | ||
| Int. Cl. G06F 12/06 (2006.01) | ||
| U.S. Cl. 711—150 [711/168; 711/148] | 9 Claims |
| 1. In a computer system comprising a first memory and a second memory, wherein the first memory is substantially faster than
the second memory, a method comprising:
inspecting a request queue for block requests from a plurality of concurrent calling processes, the request queue comprising
a plurality of block requests not yet processed by any of the plurality of concurrent calling processes, wherein each block
request calls for a block of data and wherein each block is accessed at most one time by the concurrent calling processes;
retrieving one of the plurality of block requests;
determining whether the retrieved block request can be fulfilled with a block from the first memory; and
if it is determined that the retrieved block request can be fulfilled with the block from the first memory:
retrieving the block from the first memory; and
returning the retrieved block to the calling process whose state indicates that the block is needed if the retrieved block
request can be fulfilled from the first memory.
|