Sciweavers

164 search results - page 11 / 33
» Precise Data Locality Optimization of Nested Loops
Sort
View
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
16 years 23 days ago
Lazy localization using the Frozen-Time Smoother
— We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is ‘frozen’, in the sense that the belief always refers to th...
Andrea Censi, Gian Diego Tipaldi
SC
2000
ACM
15 years 10 months ago
Hardware Prediction for Data Coherency of Scientific Codes on DSM
This paper proposes a hardware mechanism for reducing coherency overhead occurring in scientific computations within DSM systems. A first phase aims at detecting, in the address s...
Jean-Thomas Acquaviva, William Jalby
LCPC
1999
Springer
15 years 10 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
190
Voted
ICPP
1998
IEEE
15 years 10 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
APLAS
2005
ACM
15 years 12 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...