Dynamic Page Placement in a NUMA Multiprocessor Virtual Memory System

  • Authors:
  • P R LaRowe;S C Ellis

  • Affiliations:
  • -;-

  • Venue:
  • Dynamic Page Placement in a NUMA Multiprocessor Virtual Memory System
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

Non-uniformity of memory access is an almost inevitable feature of the memory architecture in shared memory multiprocessor designs that can scale to large numbers of processors. One implication of NUMA architectures is that the placement and movement of code and data become crucial to performance. The additional complexity of a main memory architecture with a distinction between local and remote memory demands that the operating system assume a larger role in providing memory management support. When one extends the investigation of NUMA memory management techniques found in the literature to consider limitations on the sizes of various main memory components and to include transparent management of the main/secondary memory hierarchy, the issues become more complex. This paper elaborates on some of these issues and proposes a dynamic page placement policy based on frame borrowing and page recall as a partial solution. The extension of our algorithm to attack the more general migration problem is also discussed. Results of experiments designed to evaluate the approach are presented.