A framework for determining useful parallelism
Frances Allen, Michael Burke, et al.
ICS 1988
We consider parallel execution of nonvectorizable uniform recurrences. 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. We address how extra processors can be applied to the independent computations. Our methods are especially attractive for multiprocessors comprised of clusters. © 1989 IEEE
Frances Allen, Michael Burke, et al.
ICS 1988
Jih-Kwon Peir, Windsor W. Hsu, et al.
Journal of Systems Architecture
Jih-Kwon Peir, Windsor W. Hsu, et al.
SIGPLAN Notices (ACM Special Interest Group on Programming Languages)
Frances Allen, Michael Burke, et al.
Journal of Parallel and Distributed Computing