Skip to main content
Journal ArticleOPEN ACCESS

Replicated placements in the polyhedron model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2790 303-308
DOI: 10.1007/978-3-540-45209-6_45
0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Loop-carried code placement (LCCP) is able to remove redundant computations that cannot be recognized by traditional code motion techniques. However, this comes possibly at the price of increased communication time. We aim at minimizing the communication time by using replicated storage. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

Faber, P., Griebl, M., & Lengauer, C. (2004). Replicated placements in the polyhedron model. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 303–308. https://doi.org/10.1007/978-3-540-45209-6_45

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