Page placement for non-uniform memory access time (NUMA) shared memory multiprocessors
Jr. Richard Philip Larowe · 1991
(Computer Science) PAGE PLACEMENT FOR NON-UNIFORM MEMORY ACCESS TIME (NUMA) SHARED MEMORY MULTIPROCESSORS by Richard P. LaRowe Jr. Department of Computer Science Duke University Date: Approved: Carla Schlatter Ellis, Supervisor Herbert Crovitz Mark Holliday Donald Loveland Robert Wagner An abstract of a dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science in the Graduate School of Duke University 1991 Abstract Shared memory multiprocessors are attractive because they are programmed in a manner similar to uniprocessors. The UMA (uniform memory access time) class of shared memory multiprocessors is the most attractive, from the programmer's point of view, since the programmer need not be concerned with the placement of code and data in the physical memory modules of the machine. Scalable shared memory multiprocessors, on the other hand, tend to present at least some degree of n...