Abstract
We discuss the static scheduling and code generation problem for message passing architectures. Using ideas from successful manually written programs for message passing architectures we have developed several new automatic algorithms for scheduling and code generation. These algorithms have been implemented in a preliminary software system named PYRROS. The purpose of this paper is to provide a justification of our approach and choice of algorithms.
Cite
CITATION STYLE
Gerasoulis, A., & Yang, T. (1992). Static scheduling of parallel programs for message passing architectures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 634 LNCS, pp. 601–612). Springer Verlag. https://doi.org/10.1007/3-540-55895-0_461
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
