Skip to main content
Conference ProceedingsOPEN ACCESS

Optimizing storage size for static control programs in automatic parallelizers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1300 LNCS 356-363
DOI: 10.1007/bfb0002757
11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

TMs article deals with automatic parallelization of static control programs. The removal of memory related dependences is usually realized by translating the original program into a single assignment form. This total data expansion has a very high memory cost. We present a technique of partial data expansion for global memory architectures which leaves untouched the performances of the parallelization process.

Cite

CITATION STYLE

APA

Lefebvre, V., & Feautrier, P. (1997). Optimizing storage size for static control programs in automatic parallelizers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 356–363). Springer Verlag. https://doi.org/10.1007/bfb0002757

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