Sciweavers

286 search results - page 21 / 58
» Reducing Overheads of Local Communications in Fine-grain Par...
Sort
View
IPPS
2003
IEEE
14 years 2 months ago
SPMD Image Processing on Beowulf Clusters: Directives and Libraries
Most image processing algorithms can be parallelized by splitting parallel loops and by using very few communication patterns. Code parallelization using MPI still involves much p...
Paulo F. Oliveira, J. M. Hans du Buf
CLUSTER
2006
IEEE
14 years 13 days ago
Improving Communication Performance on InfiniBand by Using Efficient Data Placement Strategies
Despite using high-speed network interconnection systems like InfiniBand, the communication overhead for parallel applications is still high. In this paper we show, how such costs...
Robert Rex, Frank Mietke, Wolfgang Rehm, Christoph...
IPPS
1997
IEEE
14 years 7 days ago
View Caching: Efficient Software Shared Memory for Dynamic Computations
Software distributed shared memory (DSM) techniques, while effective on applications with coarse-grained sharing, yield poor performance for the fine-grained sharing encountered i...
Vijay Karamcheti, Andrew A. Chien
DCOSS
2009
Springer
14 years 3 months ago
Detection and Localization Sensor Assignment with Exact and Fuzzy Locations
Sensor networks introduce new resource allocation problems in which sensors need to be assigned to the tasks they best help. Such problems have been previously studied in simplifi...
Hosam Rowaihy, Matthew P. Johnson, Diego Pizzocaro...
PPOPP
1997
ACM
14 years 27 days 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...