Paging tradeoffs in distributed-shared-memory multiprocessors

✍ Scribed by Douglas C. Burger; Rahmat S. Hyder; Barton P. Miller; David A. Wood

• Publisher: Springer US
• Year: 1996
• Tongue: English
• Weight: 910 KB
• Volume: 10
• Category: Article
• ISSN: 0920-8542
• DOI: 10.1007/bf00128100

✦ Synopsis

Massively parallel processors have begun using commodity operating systems that support demandpaged 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 (1) confirm the importance of gang CPU scheduling, (2) show that a page-faulting processor should spin rather than invoke a parallel context switch, (3) show that our parallel programs frequently touch most of their data, and ( ) indicate that memory, notj ust 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.