Sciweavers

782 search results - page 148 / 157
» Dag-Consistent Distributed Shared Memory
Sort
View
SPAA
1998
ACM
15 years 1 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
84
Voted
IPPS
1994
IEEE
15 years 1 months ago
Parallel Evaluation of a Parallel Architecture by Means of Calibrated Emulation
A parallel transputer-based emulator has been developed to evaluate the DDM--ahighlyparallel virtual shared memory architecture. The emulator provides performance results of a har...
Henk L. Muller, Paul W. A. Stallard, David H. D. W...
PODC
1993
ACM
15 years 1 months ago
A Lower Bound on Wait-Free Counting
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 ...
Shlomo Moran, Gadi Taubenfeld
PPOPP
1990
ACM
15 years 1 months ago
Multi-Model Parallel Programming in Psyche
Many different parallel programming models, including lightweight processes that communicate with shared memory and heavyweight processes that communicate with messages, have been...
Michael L. Scott, Thomas J. LeBlanc, Brian D. Mars...
CCGRID
2004
IEEE
15 years 1 months ago
Unifier: unifying cache management and communication buffer management for PVFS over InfiniBand
The advent of networking technologies and high performance transport protocols facilitates the service of storage over networks. However, they pose challenges in integration and i...
Jiesheng Wu, Pete Wyckoff, Dhabaleswar K. Panda, R...