Sciweavers

285 search results - page 33 / 57
» PODC: Paradigm-Oriented Distributed Computing
Sort
View
PODC
1996
ACM
14 years 29 days ago
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
Maged M. Michael, Michael L. Scott
PODC
1993
ACM
14 years 27 days 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
PODC
1994
ACM
14 years 27 days ago
A Performance Evaluation of Lock-Free Synchronization Protocols
In this paper, we investigate the practical performance of lock-free techniques that provide synchronization on shared-memory multiprocessors. Our goal is to provide a technique t...
Anthony LaMarca
PODC
1989
ACM
14 years 26 days ago
Multiple Communication in Multi-Hop Radio Networks
Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Effi...
Reuven Bar-Yehuda, Amos Israeli
PODC
1990
ACM
14 years 26 days ago
Composite Registers
We introduce a shared data object, called a composite register, that generalizes the notion of an atomic register. A composite register is an array-like shared data object that is...
James H. Anderson