Minimum distance: a method for partitioning recurrences for multiprocessors
IEEE Transactions on Computers1989Vol. 38(8), pp. 1203–1211
Abstract
Parallel execution of nonvectorizable uniform recurrences is considered. When naively scheduled, such recurrences could create unacceptable communication and synchronization on a multiprocessor. The minimum-distance method partitions such recurrences into totally independent computations without increasing redundancy or perturbing numerical stability. The independent computations are well suited for execution on a multiprocessor, but they may not utilize all available processors. How extra processors can be applied to the independent computations is addressed. The methods are especially attractive for multiprocessors comprised of clusters.>
Related Papers
- → Partitioning and mapping nested loops on multiprocessor systems(1991)40 cited
- Parallel Execution of a Sequence of tasks on a Asynchronous Multiprocessor.(1980)
- → Macropipelined execution of asynchronous processes competing for a limited number of transfer channels(1998)
- → Algorithms for Scheduling Inhomogeneous Multiprocessor Computers(1984)