1156 search results - page 40 / 232 » Efficient Barriers for Distributed Shared Memory Computers |
SPAA
1996
ACM
14 years 2 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
ICPP
1993
IEEE
14 years 2 months ago
1993
IEEE
Current and emerging high-performance parallel computer architectures generally implement one of two types of communication mechanisms: shared memory (SM) or message passing (MP)....
ICPPW
2006
IEEE
14 years 4 months ago
2006
IEEE
A motion panorama is an efficient and compact representation of the underlying video. However, the motion panorama construction process is computationally intensive and hence extr...
SIGMOD
2007
ACM
14 years 11 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
PODC
1990
ACM
14 years 2 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...