Sciweavers

946 search results - page 139 / 190
» Maximizing data locality in distributed systems
Sort
View
EGC
2005
Springer
15 years 3 months ago
The Design and Implementation of the KOALA Co-allocating Grid Scheduler
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multipl...
Hashim H. Mohamed, Dick H. J. Epema
SPAA
2010
ACM
15 years 2 months ago
Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications
Load balancing is an important consideration when running data-parallel programs. While traditional techniques trade off the cost of load imbalance with the overhead of mitigating...
Youngjoon Jo, Milind Kulkarni
CLUSTER
2004
IEEE
15 years 1 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...
IPPS
2010
IEEE
14 years 7 months ago
Restructuring parallel loops to curb false sharing on multicore architectures
The memory hierarchy of most multicore systems contains one or more levels of cache that is shared among multiple cores. The shared-cache architecture presents many opportunities f...
Santosh Sarangkar, Apan Qasem
CVPR
2008
IEEE
15 years 11 months ago
Particle filtering for registration of 2D and 3D point sets with stochastic dynamics
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
Romeil Sandhu, Samuel Dambreville, Allen Tannenbau...