Scheduling parallel tasks on hypercubes

The authors consider the problem of non-pre-emptively scheduled independent parallel tasks with communication overhead on a d-dimensional hypercube system. To find a schedule such that the schedule length is minimised is NP-hard. Therefore, a simple heuristic algorithm is investigated and its performance boundary is derived as (2+In m-1/m), where m=2/sup d/.