Memory management method for coupled memory multiprocessor systems

• US 5,237,673 A
• Filed: 03/20/1991
• Issued: 08/17/1993
• Est. Priority Date: 03/20/1991
• Status: Expired due to Term

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Digital Equipment Corporation (HP Inc.)
• Inventors: Orbits, David A., Butts, H. Bruce Jr., Abramson, Kenneth D.
• Primary Examiner(s): Dixon, Joseph L.
• Assistant Examiner(s): Robertson, David L.
• Application Number:
  US07/673,132
• Time in Patent Office: 881 Days
• Field of Search: 395/400, 395/425, 395/600
• US Class Current: 711/170
• CPC Class Codes: G06F 12/08 in hierarchically structured memory systems, e.g. virtual memory systems

Abstract

A method of managing the memory of a CM multiprocessor computer system is disclosed. A CM multiprocessor computer system includes: a plurality of CPU modules 11a . . . 11n to which processes are assigned; one or more optional global memories 13a . . . 13n; a storage medium 15a, 15b . . . 15n; and a global interconnect 12. Each of the CPU modules 11a . . . 11n includes a processor 21 and a coupled memory 23 accessible by the local processor without using the global interconnect 12. Processors have access to remote coupled memory regions via the global interconnect 12. Memory is managed by transferring, from said storage medium, the data and stack pages of a process to be run to the coupled memory region of the CPU module to which the process is assigned, when the pages are called for by the process. Other pages are transferred to global memory, if available. At prescribed intervals, the free memory of each coupled memory region and global memory is evaluated to determine if it is below a threshold. If below the threshold, a predetermined number of pages of the memory region are scanned. Infrequently used pages are placed on the end of a list of pages that can be replaced with pages stored in the storage medium. Pages associated with processes that are terminating are placed at the head of the list of replacement pages.

Claims

1. A method of managing the memory of a multiprocessor computer system including a plurality of CPU modules to which processes to be run on said computer system are assigned, said computer system also including a storage medium connected to said modules via a global interconnect, each of said CPU modules including a processor and a coupled memory region, said method comprising the steps of:

transferring, from said storage medium, the data and stack pages of a process to be run on said computer system to the coupled memory region of the CPU module to which the process is assigned; and

determining, at prescribed intervals, if the free memory of each of said coupled memory regions is below a threshold and, if below the threshold, scanning a predetermined number of pages and placing infrequently used pages on a list of pages that can be replaced with pages stored in said storage medium.

2. A method of managing the memory of a multiprocessor computer system as claimed in claim 1 wherein said multiprocessor computer system also includes global memory connected to said plurality of CPU modules and said storage medium via said global interconnect and including the step of transferring, from said storage medium, pages other than the data and stack pages of a process to be run on said computer system to said global memory.

3. A method of managing the memory of a multiprocessor computer system as claimed in claim 2 wherein said steps of transferring data and stack pages to the coupled memory region of the CPU module to which a process is assigned and said step of transferring pages other than data and stack pages of a process to be run on said computer system to said global memory includes a page fault process.

4. A method of managing the memory of a multiprocessor computer system as claimed in claim 3 wherein said page fault process first determines if a page is in said coupled memory regions or said global memory and, thus, is reclaimable before transferring a page to the appropriate one of said coupled memory regions and said global memory.

5. A method of managing the memory of a multiprocessor computer system as claimed in claim 4 wherein reclaimable pages other than data and stack pages are reclaimed in global memory and wherein data or stack pages located in the coupled memory region of a CPU module to which a process has been assigned are reclaimed in said coupled memory region.

6. A method of managing the memory of a multiprocessor computer system as claimed in claim 5 wherein reclaimable pages not located in the coupled memory of the CPU module to which a process is assigned are copied into the coupled memory of the CPU module to which a process is assigned.

7. A method of managing the memory of a multiprocessor computer system as claimed in claim 6 wherein nonreclaimable data and stack pages are allocated to the coupled memory of the CPU module to which a process is assigned and wherein nonreclaimable pages other than data and stack pages are allocated to global memory.

8. A method of managing the memory of a multiprocessor computer system as claimed in claim 1 or 2, including a paging daemon associated with each coupled memory region of each CPU module to which processes can be assigned.

9. A method of managing the memory of a multiprocessor computer system as claimed in claim 8 wherein said paging daemon:

(i) determines the number of pages to scan if the free memory of a particular region is less than a threshold;

(ii) on a page-by-page basis, determines if each page of the number scanned is still in use; and

(iii) deallocates pages not in use by placing them either at the head or the end of a free page list associated with the particular region running the paging daemon.

10. A method of managing the memory of a multiprocessor computer system as claimed in claim 9 wherein said paging daemon includes front and back clock hands programmed to point at spaced-apart pages, said clock hands being incremented after each determination of whether a page is still in use.

11. A method of managing the memory of a multiprocessor computer system as claimed in claim 10 wherein said step of determining if a page is still in use includes a determination of whether a page is dirty and writing dirty pages to disk before they are deallocated.

12. A method of managing the memory of a multiprocessor computer system as claimed in claim 11 wherein pages associated with terminating processes are placed at the head of the free page list of the associated coupled memory region and other pages are placed at the end of the free page list of the associated coupled memory region.

13. A method of managing the memory of a multiprocessor computer system as claimed in claim 2 wherein said step of transferring, from said storage medium, data and stack pages to the coupled memory region of the CPU module to which a process is assigned and the step of transferring, from said storage medium, pages other than data and stack pages to global memory includes a page allocation routine.

14. A method of managing the memory of a multiprocessor computer system as claimed in claim 13 wherein said page allocation routine allocates pages other than data and stack pages to global memory and allocates data and stack pages to the coupled memory of the CPU module to which a related process is assigned.

15. A method of managing the memory of a multiprocessor computer system as claimed in claim 14, including a paging daemon associated with each coupled memory region of each CPU module to which processes can be assigned.

16. A method of managing the memory of a multiprocessor computer system as claimed in claim 15 wherein said paging daemon:

(i) determines the number of pages to scan if the free memory of a particular region is less than a threshold;

(ii) on a page-by-page basis, determines if each page of the number scanned is still in use; and

(iii) deallocates pages not in use by placing them either at the head or the end of a free page list associated with the particular region running the paging daemon.

17. A method of managing the memory of a multiprocessor computer system as claimed in claim 15 wherein said page allocation routine wakes up said paging daemon if sufficient memory is not available in the memory region to which a page is allocated.

18. A method of managing the memory of a multiprocessor computer system as claimed in claim 17 wherein said page allocation routine waits for said paging daemon to be executed if adequate free memory is not available in the memory region to which a page has been assigned.