Results 1 
6 of
6
Hundreds of Impossibility Results for Distributed Computing
 Distributed Computing
, 2003
"... We survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models. The parameters of the models considered include synchrony, faulttolerance, different communication media, and randomization. The resource bounds refe ..."
Abstract

Cited by 52 (5 self)
 Add to MetaCart
We survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models. The parameters of the models considered include synchrony, faulttolerance, different communication media, and randomization. The resource bounds refer to time, space and message complexity. These results are useful in understanding the inherent difficulty of individual problems and in studying the power of different models of distributed computing.
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 32 (2 self)
 Add to MetaCart
(Show Context)
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.
Data Requirements for Implementation of NProcess Mutual Exclusion Using a Single Shared Variable
, 1982
"... All analyss s made of the shared memory reqmrements for tmplemelltllg mutual exclusmon of N asynchronous parallel processes m a model where the only primitive communication mechamsm is a general testandset operatmn on a smgle shared variable. Whde two variable values suffice to tmplement simple mu ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
All analyss s made of the shared memory reqmrements for tmplemelltllg mutual exclusmon of N asynchronous parallel processes m a model where the only primitive communication mechamsm is a general testandset operatmn on a smgle shared variable. Whde two variable values suffice to tmplement simple mutual exclusion wthout deadlock, tt is shown that any soluuon whtch avoids possible lockout of processes reqmres at least 2 + values A technical restncnon on [he model increases this reqmrement to N/2 values, whde achieving a fixed bound on wamng further increases the reqmrement to N + 1 values. These bounds are shown to be nearly optimal, for algorithms are exhibtted for the last two cases which use [NJ2] + 9 and N + 3 values, respectively All of the lower bounds apply a fortJori to the space requirements for weaker pnmitves, such as P and V, using busy wamng Categories and Subject Descriptors D 4 1 ]Operating Systems]' Proces Managemen;mutual excluswn; D 4 2 IOperatlng Systems]' Storage Management F I I [Computatloa by Abstract Device9]: Models of Computanon, F 1.2 [Computation by Abstract Devices]' Modes ofComputatton?arallehsm, F 2 [lheory of Computation] Analysis o Algomhms and Problem Complexity General Terms Algorithms, Performance, Theory Addmonal Key Words and Phrases' critical section, test and set, asynchronous processes. synchTomzauo l.
Some perspectives on PODC
, 2003
"... Hagit Attiya and Sergio Raisbaum asked me quite some time... ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Hagit Attiya and Sergio Raisbaum asked me quite some time...
Shared data requirements for implementation of mutual exclusion using a testandset primitive
 In Proc. of the International Conference on Parallel Processing
, 1978
"... We analyze the shared memory requirements for implementing mutual exclusion of N asynchronous parallel processes in a model where the only primitive communication mechanism is a generalized testandset operation. While two memory states suffice to implement mutual exclusion, we show that any soluti ..."
Abstract
 Add to MetaCart
We analyze the shared memory requirements for implementing mutual exclusion of N asynchronous parallel processes in a model where the only primitive communication mechanism is a generalized testandset operation. While two memory states suffice to implement mutual exclusion, we show that any solution which avoids_possible lockout of processes requires at least 2N % states. A technical restriction on the model increases this requirement to (N+l)/2 states, while achieving bounded waiting ("fairness") further increases the requirement to N+I states. These bounds are nearly optimal, for we exhibit algorithms for the last two cases using [N/2J +9 and N+3 states, respectively. All our lower bounds apply a foriorl to the space requirements for weaker primitives such as P and V using busywaiting.