ResearchIndex Home S-P. Lo and V. D. Gligor. A comparative analysis of multiprocessor scheduling algorithms . In 7th Intl. Systems For efficient computing, simultaneously running frequently communicating threads is a relatively good scheduling policy.
Gang scheduling runs all threads of a parallel process simultaneously.
Gang scheduling has been implemented on various systems. An Alliant FX 8 in Cedar is called a cluster. A comparative analysis of multiprocessor scheduling algorithms . In 7th Intl. It should be noted, however, that other schemes most notably variable partitioning provide the same support.