Processor allocation vs. job scheduling on hypercube computers

The roles of processor allocation and job scheduling in achieving good performance on hypercube computers are compared. It is shown that the choice of job scheduling discipline has a dramatic effect on performance. A family of scheduling disciplines, called Scan, with particular performance advantages is proposed. Furthermore, it is shown that if Scan scheduling is used, the choice of processor allocation strategy has negligible effect on performance. As a result, complex allocation strategies can be replaced by a simple O(n) strategy.<<ETX>>