Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

EUROPAR
2003
Springer

favoriteEmaildiscussreport

93views Distributed And Parallel Com...» more EUROPAR 2003»

Replicated Placements in the Polyhedron Model

13 years 9 months ago

Replicated Placements in the Polyhedron Model

Download www.infosun.fim.uni-passau.de

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.

Peter Faber, Martin Griebl, Christian Lengauer

Real-time Traffic

Communication Time | EUROPAR 2003 | Loop-carried Code Placement | Traditional Code Motion |

claim paper

Related Content

» A Linear Algebra Formulation for Optimising Replication in Data Parallel Programs

» LoopCarried Code Placement

» Study of Different Replica Placement and Maintenance Strategies in Data Grid

» Replica Placement Strategies in Data Grid

» A ListBased Strategy for Optimal Replica Placement in Data Grid Systems

» HeuristicsBased Replication Schemas for Fast Information Retrieval over the Internet

» Distributed Algorithm for Service Replication in Service Overlay Network

» Modeling instruction placement on a spatial architecture

» Simulation of Dynamic Data Replication Strategies in Data Grids

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	EUROPAR
Authors	Peter Faber, Martin Griebl, Christian Lengauer

Comments (0)