Sciweavers

619 search results - page 75 / 124
» Programming Distributed Memory Sytems Using OpenMP
Sort
View
PDCN
2004
13 years 9 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
EUROPAR
2008
Springer
13 years 9 months ago
MPC: A Unified Parallel Runtime for Clusters of NUMA Machines
Over the last decade, Message Passing Interface (MPI) has become a very successful parallel programming environment for distributed memory architectures such as clusters. However, ...
Marc Pérache, Hervé Jourdren, Raymon...
SC
2003
ACM
14 years 28 days ago
Dyn-MPI: Supporting MPI on Non Dedicated Clusters
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participa...
D. Brent Weatherly, David K. Lowenthal, Mario Naka...
JPDC
2006
100views more  JPDC 2006»
13 years 7 months ago
Dyn-MPI: Supporting MPI on medium-scale, non-dedicated clusters
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participati...
D. Brent Weatherly, David K. Lowenthal, Mario Naka...
LCPC
2007
Springer
14 years 1 months ago
Automatic Communication Performance Debugging in PGAS Languages
Recent studies have shown that programming in a Partition Global Address Space (PGAS) language can be more productive than programming in a message passing model. One reason for th...
Jimmy Su, Katherine A. Yelick