language: en

[Appears in: "Supercomputing '94," Nov. 1994.]

[Reprinted by permission of IEEE.]

Paging Tradeoffs in Distributed-Shared-Memory Multiprocessors

Douglas C. Burger, Rahmat S. Hyder, Barton P. Miller, David A. Wood
Computer Sciences Department University of Wisconsin-Madison
1210 W. Dayton Street Madison, WI 53706 USA
wwt@cs.wisc.edu

Abstract Massively parallel processors have begun using commodity operating systems that support demand-paged virtual memory. To evaluate the utility of virtual memory, we measured the behavior of seven shared-memory parallel application programs on a simulated distributed-shared-memory machine. Our results (i) confirm the importance of gang CPU scheduling, (ii) show that a page-faulting processor should spin rather than invoke a parallel context switch, (iii) show that our parallel programs frequently touch most of their data, and (iv) indicate that memory, not just CPUs, must be "gang scheduled". Overall, our experiments demonstrate that demand paging has limited value on current parallel machines because of the applications' synchronization and memory reference patterns and the machines' high page-fault and parallel-context-switch overheads.

1 Introduction