Issue No. 08 - August (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.30873
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 suite
minimum distance; parallel execution; partitioning recurrences; multiprocessors; nonvectorizable uniform recurrences; totally independent computations; numerical stability; clusters; computer networks; multiprocessing systems.
J.-K. Peir, R. Cytron, "Minimum Distance: A Method for Partitioning Recurrences for Multiprocessors", IEEE Transactions on Computers, vol. 38, no. , pp. 1203-1211, August 1989, doi:10.1109/12.30873