Method for prefetching non-contiguous data structures
- Ridgefield, CT
- Croton On Hudson, NY
- Yorktown Heights, NY
- Mount Kisco, NY
- Irvington, NY
- Cortlandt Manor, NY
- Ossining, NY
- Brewster, NY
- Bedford Hills, NY
A low latency memory system access is provided in association with a weakly-ordered multiprocessor system. Each processor in the multiprocessor shares resources, and each shared resource has an associated lock within a locking device that provides support for synchronization between the multiple processors in the multiprocessor and the orderly sharing of the resources. A processor only has permission to access a resource when it owns the lock associated with that resource, and an attempt by a processor to own a lock requires only a single load operation, rather than a traditional atomic load followed by store, such that the processor only performs a read operation and the hardware locking device performs a subsequent write operation rather than the processor. A simple perfecting for non-contiguous data structures is also disclosed. A memory line is redefined so that in addition to the normal physical memory data, every line includes a pointer that is large enough to point to any other line in the memory, wherein the pointers to determine which memory line to prefect rather than some other predictive algorithm. This enables hardware to effectively prefect memory access patterns that are non-contiguous, but repetitive.
- Research Organization:
- International Business Machines Corporation (Armonk, NY)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- Assignee:
- International Business Machines Corporation (Armonk, NY)
- Patent Number(s):
- 7,529,895
- Application Number:
- 11/617,276
- OSTI ID:
- 988154
- Country of Publication:
- United States
- Language:
- English
Effective jump-pointer prefetching for linked data structures
|
journal | May 1999 |
A prefetching technique for irregular accesses to linked data structures
|
conference | January 1999 |
Compiler-based prefetching for recursive data structures
|
journal | September 1996 |
Similar Records
Low latency memory access and synchronization
Data prefetching in shared memory multiprocessors