On Gang Scheduling and Demand Paging
Dan Cristian Marinescu, Kuei Yu Wang · Purdue e-Pubs (Purdue University System) · 1996
Uniprocessor system schedulers hide the high latency of a page fault, by performing a context switch from the process or thread experiencing the fault to another process ready to run.Gang scheduling attempts to schedule all the processes in a process group at the same time.Processes in a process group do not experience page faults at precisely the same time, and process group context switching is in general fairly expensive therefore one cannot hide the latency of a page fault by means of a group context switch.This paper examlnes several scheduling strategies for systems which support both gang scheduling and demand paging and reports some measurements of the paging activity of SPMD programs on the Intel Paragon running OSF/1 under Mach.