Results 1 
5 of
5
Distributed FIFO Allocation of Identical Resources Using Small Shared Space
 ACM Transactions on Programming Languages and Systems
, 1989
"... Devices]: Modes of Computation parallelism General Terms: Algorithms, Performance, Reliability, Theory Additional Key Words and Phrases: Asynchronous system, distributed computing,' FIFO, lower bound, queue, resource allocation, shared memory, space complexity This work was supported in par ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
Devices]: Modes of Computation parallelism General Terms: Algorithms, Performance, Reliability, Theory Additional Key Words and Phrases: Asynchronous system, distributed computing,' FIFO, lower bound, queue, resource allocation, shared memory, space complexity This work was supported in part by the Office of Naval Research under contract N0001482K0154; by the U.S. Army Research Office under contract DAAG2979C0155; and by the National Science Foundation under grants MCS7702474, MCS7715628, MCS7801689, MCS8116678, and DCR8405478. N. A. Lynch's work was supported by NSF grant CCR8611442, DARPA N0001483K 0125, and ONR N0001485K0168.
Computing with infinitely many processes under assumptions on concurrency and participation
 In 14th Int. Symp. on DIStributed Comp. (DISC
, 2000
"... We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possi ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in models with finite bounds on the number of processes, and prove several new results. These include improved bounds for election when participation is required (even for finitely many processes, as investigated by Styer and Peterson [SP89]) and a new adaptive starvationfree mutual exclusion algorithm for unbounded concurrency. We survey results in models with shared objects stronger than atomic registers, such as test&set bits, semaphores or readmodifywrite registers, and update them for the infinite process case.
A New Solution to Lamport's Concurrent Programming . . .
, 1983
"... A new solution to the concurrent programming control (mutual exclusion) problem that is immune to process failures and restarts is presented. The algorithm uses just four values of shared memory per process, which is within one value of the known lower bound. The algorithm is implemented using two b ..."
Abstract
 Add to MetaCart
A new solution to the concurrent programming control (mutual exclusion) problem that is immune to process failures and restarts is presented. The algorithm uses just four values of shared memory per process, which is within one value of the known lower bound. The algorithm is implemented using two binary variables that make it immune to read errors occurring during writes, that is, "flickering bits."
Fairness of Shared Objects (Extended Abstract)
"... ) Michael Merritt ? Gadi Taubenfeld ?? Abstract. Fairness in concurrent systems can be viewed as an abstraction that bridges lowlevel timing guarantees and make them available to programmers with a minimal loss of power and a maximal ease of use. We investigate the implementation and power ..."
Abstract
 Add to MetaCart
(Show Context)
) Michael Merritt ? Gadi Taubenfeld ?? Abstract. Fairness in concurrent systems can be viewed as an abstraction that bridges lowlevel timing guarantees and make them available to programmers with a minimal loss of power and a maximal ease of use. We investigate the implementation and power of a range of fairness models that are appropriate to the synchronous, semisynchronous and asynchronous contexts of various concurrent systems. 1 Introduction 1.1 Motivation Fairness is a powerful abstraction that has led to fruitful results in the theory of concurrent, distributed and nondeterministic programs. Various notions of fairness can be explained very briefly, but small differences have important consequences on the computability and complexity of concurrent systems. We investigate the implementation and power of a range of fairness models that are appropriate to the synchronous, semisynchronous and asynchronous contexts of various concurrent systems. While some previous wo...
AND
"... A general theorem is proved which shows how a system of contending asynchronous processes with a special auxiliary supervisor process can be simulated by a system of contending processes without such a supervisor, with only a small increase in the shared space needed for communication. Two applicati ..."
Abstract
 Add to MetaCart
(Show Context)
A general theorem is proved which shows how a system of contending asynchronous processes with a special auxiliary supervisor process can be simulated by a system of contending processes without such a supervisor, with only a small increase in the shared space needed for communication. Two applications are presented, synchronization algorithms with different fairness properties requiring N + c and [N/2] + c (c a constant) shared values to synchronize N processes, respectively. I.