506 search results - page 29 / 102 » Distributing synchronous programs using bounded queues |
CC
2000
Springer
15 years 4 months ago
2000
Springer
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of created objects whose lifetime is bounded by the life...
105
click to vote
PODC
2009
ACM
15 years 9 months ago
2009
ACM
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
104
click to vote
ICPP
1997
IEEE
15 years 4 months ago
1997
IEEE
r The lack of a versatile software tool for parallel program development has been one of the major obstacles for exploiting the potential of high-performance architectures. In this...