Sciweavers

2609 search results - page 68 / 522
» Optimizing for parallelism and data locality
Sort
View
83
Voted
AAAI
2006
15 years 1 months ago
Probabilistic Self-Localization for Sensor Networks
This paper describes a technique for the probabilistic self-localization of a sensor network based on noisy inter-sensor range data. Our method is based on a number of parallel in...
Dimitri Marinakis, Gregory Dudek
SNPD
2003
15 years 1 months ago
Incomplete Information Processing for Optimization of Distributed Applications
This paper focuses on non-strict processing, optimization, and partial evaluation of MPI programs which use incremental data structures (ISs). We describe the design and implement...
Alfredo Cristóbal-Salas, Andrei Tchernykh, ...
99
Voted
DATE
2003
IEEE
92views Hardware» more  DATE 2003»
15 years 5 months ago
An Integrated Approach for Improving Cache Behavior
The widening gap between processor and memory speeds renders data locality optimization a very important issue in data-intensive embedded applications. Throughout the years hardwa...
Gokhan Memik, Mahmut T. Kandemir, Alok N. Choudhar...
105
Voted
PPOPP
1997
ACM
15 years 4 months ago
Performance Implications of Communication Mechanisms in All-Software Global Address Space Systems
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
Beng-Hong Lim, Chi-Chao Chang, Grzegorz Czajkowski...
111
Voted
ICPP
2008
IEEE
15 years 7 months ago
A List-Based Strategy for Optimal Replica Placement in Data Grid Systems
—Data replications is a typical strategy for improving access performance and data availability in Data Grid systems. Current works on data replication in Grid systems focus on t...
Yi-Fang Lin, Jan-Jan Wu, Pangfeng Liu