Gang Scheduling with Memory Considerations

@inproceedings{Batat2000GangSW,
  title={Gang Scheduling with Memory Considerations},
  author={Anat Batat and Dror G. Feitelson},
  booktitle={IPDPS},
  year={2000}
}
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 performanc e by preventing the harmful effects of paging and thrashing. 
Highly Cited
This paper has 100 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 63 extracted citations

100 Citations

051015'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 100 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

A Workload Model for Parallel Computer Systems

  • U. Lublin
  • Master’s thesis, Hebrew University,
  • 1999
1 Excerpt

Volovic, “The ParPar system: a software MPP

  • D. G. Feitelson, A. Batat, +6 authors A M.
  • In High Performance Cluster Computing,
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…