Skip to main content
Conference ProceedingsOPEN ACCESS

Solutions to the communication minimization problem for afflne recurrence equations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1300 LNCS 328-337
DOI: 10.1007/bfb0002752
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper deals with communication optimization which is a crucial issue in automatic parallelization. From a system of parameterized affine recurrence equations, we propose a heuristic which determines an efficient space-time transformation. It reduces first the distant communications and then the local communications.

Author supplied keywords

Cite

CITATION STYLE

APA

Loechner, V., & Mongenet, C. (1997). Solutions to the communication minimization problem for afflne recurrence equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 328–337). Springer Verlag. https://doi.org/10.1007/bfb0002752

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free