Abstract
This paper addresses the NP-hard problem of scheduling a cyclic set of interdependent operations, representing a program loop, when a finite number of identical processors are available. We give a simple and efficient algorithm producing close to optimum results. As a side result our algorithm guarantees optimality when the number of processors is infinite.
Cite
CITATION STYLE
Gasperoni, F., & Schwiegelshohn, U. (1992). Scheduling loops on parallel processors: A simple algorithm with close to optimum performance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 634 LNCS, pp. 625–636). Springer Verlag. https://doi.org/10.1007/3-540-55895-0_463
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
