@inproceedings{b288bcd4003d447eafa216dae6ea7b68,
title = "MINIMUM DISTANCE: A METHOD FOR PARTITIONING RECURRENCES FOR MULTIPROCESSORS.",
abstract = "The execution of a class of nonvectorizable loops on multiprocessors, namely, linear recurrences, is considered. When naively scheduled, such recurrences could create unnecessary communication and synchronization on a multiprocessor. A method called minimum-distance, which can create totally independent computations from recurrences, is presented. The independent computations are well-suited for execution on a multiprocessor, but they may not require all available processors. Ways in which extra processors can be allocated within the independent computations are given.",
author = "Peir, \{Jih Kwon\} and Ron Cytron",
year = "1987",
language = "English",
isbn = "0271006080",
series = "Proceedings of the International Conference on Parallel Processing",
publisher = "Pennsylvania State Univ Press",
pages = "217--225",
editor = "Sahni, \{Sartaj K.\}",
booktitle = "Proceedings of the International Conference on Parallel Processing",
note = "Proc Int Conf Parallel Process 1987 ; Conference date: 17-08-1987 Through 21-08-1987",
}