Abstract
Mapping a parallel algorithm onto a paralld computer is known to be NP-hard. In this paper we propose a parallel mapping technique based on a generalization of the Kernighan-Lin heuristic. The properties of a mapping cost function are thereby exploited.
Cite
CITATION STYLE
APA
De Keyser, J., & Roose, D. (1994). Distributed mapping of SPMD programs with a generalized Kernighan-Lin heuristic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 797 LNCS, pp. 227–232). Springer Verlag. https://doi.org/10.1007/3-540-57981-8_123
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free