Dynamic memory placement policies for NUMA architecture

Electrical computers and digital processing systems: multicomput – Multicomputer data transferring via shared memory – Plural shared memories

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S216000, C709S218000, C711S147000, C711S148000

Reexamination Certificate

active

06871219

ABSTRACT:
A distributed shared memory multiprocessor computer system utilizes page placement policies to reduce data access latencies. Pages of memory are allocated to nodes in a distributed shared memory multiprocessor computer system. A placement policy database is maintained which indicates a placement policy for each page in the system. Upon an access to a page, the placement policy corresponding to the accessed page is determined and the indicated policy is acted upon. A Migrate on Next Touch policy provides that the next access to a page with this policy will cause the page to migrate to the node of the accessing CPU. A Memory Follows Lightweight Process (LWP) policy ensures that pages within a given address range are always local to a specified LWP. A Migrate on Every Touch policy provides that pages within a given address range are migrated to an accessing CPU on every touch. A Replicate on Remote Touch policy provides for replication of a page in the memory of each accessing CPU's domain. Finally, a Replicate on All policy provides that upon an access to a given page, that page is replicated on all nodes in the system.

REFERENCES:
patent: 6026472 (2000-02-01), James et al.
patent: 6035377 (2000-03-01), James et al.
patent: 6167437 (2000-12-01), Stevens et al.
patent: 6247041 (2001-06-01), Krueger et al.
patent: 6272612 (2001-08-01), Bordaz et al.
patent: 6289424 (2001-09-01), Stevens
patent: 6360302 (2002-03-01), Baylor
patent: 982660 (2000-03-01), None
US 6,021,479, 2/2000, Stevens (withdrawn)
“Extending OpenMP for NUMA Machines”; J. Bircsak, P.Craig, R. Crowell, Z. Cvetanovic, J, Harris, C. Nelson, and C. Offner; In Proc. of the IEEE/ACM Supercomputing '2000: High Performance Networking and Computing Conference (SC2000), Nov. 2000.
“Exploiting Operating System Support for Dynamic Page Placement on a NUMA Shared Memory Multiprocessor”; R. LaRowe Jr., J. Wilkes, C. Ellis; Department of Computer Science, Duke University, Durham, NC.
“Operating System Support for Improving Data Locality on CC-NUMA Compute Servers”; B. Verghese, S. Devine, A. Gupta, and M. Rosenblum; Computer Sytem Laboratory, Stanford University, CA; c. 1996; The Association for Computing Machinery, Inc.
“Dynamic Storage Allocation: A Survey and Critical Review”; P. Wilson, M. Johnstone, M. Neely, and D. Boles; Department of Computer Sciences, University of Texas at Austin, Austin, TX.
“User-Level Dynamic Page Migration for Multiprogrammed Shared-Memory Multiprocessors”; Nikolopoulos D.S., et al.; Proceedings 2000 International Conference on Parallel Processing; Aug. 21, 2000; pp. 95-103.
“Scheduling and Page Migration for Multiprocessor Compute Servers”; Rohit, Chandra, et al.; ACM SIGPLAN Notices; Association for Computing Machinery; New York, US; vol. 29, No. 11; Nov. 1, 1994; pp.12-24.
“NUMA Policies and Their Relation to Memory Architecture”; Bolosky, W.J., et al.; Computer Architecture News; Association for Computing Machinery; New York, U.S.; vol. 19, No. 2; Apr. 1, 1991; pp. 212-221.
International Search Report; International application No. PCT/US 02/06866; Filed Mar. 4, 2002.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Dynamic memory placement policies for NUMA architecture does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic memory placement policies for NUMA architecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic memory placement policies for NUMA architecture will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3396195

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.