Sciweavers

1156 search results - page 58 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
13 years 10 months ago
Constructive, Deterministic Implementation of Shared Memory on Meshes
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
14 years 2 months ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran
ICS
2009
Tsinghua U.
13 years 8 months ago
Efficient high performance collective communication for the cell blade
This paper presents high-performance collective communication algorithms and implementations that exploit the unique architectural features of the Cell heterogeneous multicore pro...
Qasim Ali, Samuel P. Midkiff, Vijay S. Pai
MOBIHOC
2010
ACM
13 years 8 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
WDAG
2001
Springer
78views Algorithms» more  WDAG 2001»
14 years 3 months ago
Self Stabilizing Distributed Queuing
Distributed queuing is a fundamental coordination problem, arising in a variety of applications, including distributed shared memory, distributed directories, and totally ordered ...
Maurice Herlihy, Srikanta Tirthapura