Adaptive memory management method for coupled memory multiproces

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364DIG1, 3642281, 3642291, 3642292, 3642434, G06F 1314

Patent

active

052690130

ABSTRACT:
An adaptive memory management method for coupled memory multiprocessor computer systems is disclosed. In a coupled memory multiprocessor system all the data and stack pages of processes assigned to individual multiprocessors are, preferably, located in a memory region coupled to the assigned processor. When this becomes impossible, some data and stack pages are assigned to global memory or memory regions coupled to other processors. The present invention is a method of making certain that the most referenced data and stack pages are located in the coupled memory of the processor to which a specific process is assigned and lesser referenced pages are located in global memory or the coupled memory region of other processors. This result is accomplished by sampling the memory references made by the processors of the computer system and causing the most recently referenced pages in each coupled memory region to be maintained at the head of an active page list. References to remote data and stack pages are stored in a remote page hash table. Remote pages are pages stored in global memory or in coupled memory other than the coupled memory of the processor to which the process owning the pages is assigned. Any remote data and stack pages referenced more frequently than pages stored in a processor's coupled memory region are transferred to the processor's coupled memory region. If a processor's coupled memory region is tight, pages are transferred from the processor's coupled memory region to global memory or to the coupled memory region of another processor.

REFERENCES:
patent: 4403286 (1983-09-01), Fry et al.
patent: 4463424 (1984-07-01), Mattson et al.
patent: 4571672 (1986-02-01), Hatada et al.
patent: 4591977 (1986-05-01), Nissen et al.
patent: 4633387 (1986-12-01), Hartung et al.
patent: 4636946 (1987-01-01), Hartung et al.
patent: 4638424 (1987-01-01), Beglin et al.
patent: 4771375 (1988-09-01), Beglin et al.
patent: 4811216 (1989-03-01), Bishop et al.
patent: 4812981 (1989-03-01), Chan et al.
patent: 4928239 (1990-05-01), Baum et al.
patent: 4933837 (1990-06-01), Freidin
patent: 4939636 (1990-07-01), Nakagawa et al.
patent: 4980822 (1990-12-01), Brantley, Jr. et al.
patent: 5043885 (1991-08-01), Robison
patent: 5093913 (1992-03-01), Bishop et al.
patent: 5117350 (1992-05-01), Parrish et al.
patent: 5123106 (1992-06-01), Otsuki et al.
patent: 5146607 (1992-09-01), Sood et al.
William J. Bolosky and Michael L. Scott, "Simple But Effective Techniques for NUMA Memory Management," University of Rochester, Rochester, N.Y., Mar. 1989.
Alan L. Cox and Robert J. Fowler, "The Implementation of a Coherent Memory Abstraction on a NUMA Multiprocessor: Experiences with Platinum" (Revised), University of Rochester, Rochester, N.Y., May 6, 1989.
Ming-Chit Tam, Jonathan M. Smith and David J. Farber, "A Taxonomy-Based Comparison of Several Distributed Shared Memory Systems," University of Pennsylvania, Philadelphia, Pa., May 15, 1990.
Robert H. Thomas and Will Crowther, "The Uniform System: An approach to runtime support for large scale shared memory parallel processors," Cambridge, Mass.

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

Adaptive memory management method for coupled memory multiproces does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Adaptive memory management method for coupled memory multiproces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive memory management method for coupled memory multiproces will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2022069

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