Scheduling Trees with Large Communication Delays on Two Identical Processors
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Scheduling trees with large communication delays on two identical processors
Journal of Scheduling
Efficient mining of statistical dependencies
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
We present algorithms for optimally scheduling computations that comprise a sequence of complete up- and/or down-sweeps on a complete binary tree, on a parallel architecture in which the communication delay between any two processors is uniform. Such computations include, for instance, those that implement broadcast, accumulation, and the parallel-prefix operator; such architectures include, for instance, networks of workstations. Our schedules are optimal in the sense of having the actual minimum time-to-completion-not just on approximation thereof-considering the time for both computation and communication. We concentrate on schedules for fine-grain tree-sweep computations-wherein communication costs are rather large relative to per-task computation cost.