1156 search results - page 190 / 232 » Efficient Barriers for Distributed Shared Memory Computers |
PODC
1993
ACM
13 years 11 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
PPOPP
1990
ACM
13 years 11 months ago
1990
ACM
Many different parallel programming models, including lightweight processes that communicate with shared memory and heavyweight processes that communicate with messages, have been...
ISHPC
2000
Springer
13 years 11 months ago
2000
Springer
This paper describes the implementation and evaluation of the OpenMP compiler designed for the Hitachi SR8000 Super Technical Server. The compiler performs parallelization for the ...
HPCA
1995
IEEE
13 years 11 months ago
1995
IEEE
Shared memory is an appealing abstraction for parallel programming. It must be implemented with caches in order toperform well, however, and caches require a coherence mechanism t...
PVM
2010
Springer
13 years 6 months ago
2010
Springer
With the ever-increasing numbers of cores per node on HPC systems, applications are increasingly using threads to exploit the shared memory within a node, combined with MPI across ...