Sciweavers

26 search results - page 1 / 6
» Replicated Placements in the Polyhedron Model
Sort
View
EUROPAR
2003
Springer
13 years 10 months ago
Replicated Placements in the Polyhedron Model
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 ...
Peter Faber, Martin Griebl, Christian Lengauer
LCPC
1999
Springer
13 years 9 months ago
A Linear Algebra Formulation for Optimising Replication in Data Parallel Programs
In this paper, we present an efficient technique for optimising data replication under the data parallel programming model. We propose a precise mathematical representation for da...
Olav Beckmann, Paul H. J. Kelly
EUROPAR
2001
Springer
13 years 9 months ago
Loop-Carried Code Placement
Abstract. Traditional code optimization techniques treat loops as nonpredictable structures and do not consider expressions containing array accesses for optimization. We show that...
Peter Faber, Martin Griebl, Christian Lengauer
CCGRID
2007
IEEE
13 years 11 months ago
Study of Different Replica Placement and Maintenance Strategies in Data Grid
Data replication is an excellent technique to move and cache data close to users. By replication, data access performance can be improved dramatically. One of the challenges in da...
Rashedur M. Rahman, Ken Barker, Reda Alhajj
GRID
2008
Springer
13 years 4 months ago
Replica Placement Strategies in Data Grid
Replication is a technique used in Data Grid environments that helps to reduce access latency and network bandwidth utilization. Replication also increases data availability thereb...
Rashedur M. Rahman, Ken Barker, Reda Alhajj