Sciweavers

1390 search results - page 188 / 278
» Coordination Patterns for Parallel Computing
Sort
View
PPOPP
2010
ACM
13 years 7 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...
IPPS
2010
IEEE
13 years 7 months ago
Improving numerical reproducibility and stability in large-scale numerical simulations on GPUs
The advent of general purpose graphics processing units (GPGPU's) brings about a whole new platform for running numerically intensive applications at high speeds. Their multi-...
Michela Taufer, Omar Padron, Philip Saponaro, Sand...
CCGRID
2003
IEEE
14 years 2 months ago
Noncontiguous I/O Accesses Through MPI-IO
I/O performance remains a weakness of parallel computing systems today. While this weakness is partly attributed to rapid advances in other system components, I/O interfaces avail...
Avery Ching, Alok N. Choudhary, Kenin Coloma, Wei-...
IPPS
1998
IEEE
14 years 1 months ago
COMPaS: A Pentium Pro PC-based SMP Cluster and Its Experience
We have built an eight node SMP cluster called COMPaS (Cluster Of Multi-Processor Systems), each node of which is a quadprocessor Pentium Pro PC. We have designed and implemented a...
Yoshio Tanaka, Motohiko Matsuda, Makoto Ando, Kazu...
SC
1994
ACM
14 years 1 months ago
Run-time and compile-time support for adaptive irregular problems
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
Shamik D. Sharma, Ravi Ponnusamy, Bongki Moon, Yua...