Packing Schemes for

  • Gang SchedulingDror G. FeitelsonInstitute
  • Published 1996
Jobs that do not require all processors in the system can be packed together for gang scheduling. We examine accounting traces from several parallel computers to show that indeed many jobs have small sizes and can be packed together. We then formulate a number of such packing algorithms, and evaluate their eeectiveness using simulations based on our… CONTINUE READING