Gang scheduling with memory considerations

Anat Batat*, Dror G. Feitelson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

68 Scopus citations


A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job's processes. An alternative is to impose admission controls, and only admit jobs that fit into the available memory. Despite suffering from delayed execution, this leads to better overall performance by preventing the harmful effects of paging and thrashing.

Original languageAmerican English
Pages (from-to)109-114
Number of pages6
JournalProceedings of the International Parallel Processing Symposium, IPPS
StatePublished - 2000


Dive into the research topics of 'Gang scheduling with memory considerations'. Together they form a unique fingerprint.

Cite this