On using network attached disks as shared memory
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
Common2 extended to stacks and unbounded concurrency
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
The 0---1-Exclusion Families of Tasks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Theoretical Computer Science
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Computing with infinitely many processes
Information and Computation
| Hi-index | 0.00 |
The Herlihy-Shavit (HS) conditions characterizing the solvability of asynchronous tasks over n processors have been a milestone in the development of the theory of distributed computing. Yet, they were of no help when researcher sought algorithms that do not depend on n.Tohelp in this pursuit we investigate the uniform solvability of an infinite uniform sequence of tasks T0, T1, T2, 驴,where Ti is a task over processors p0, p1,驴, pi , and Ti extends Ti- 1. We say that such a sequence is uniformly solvable if there exit protocols to solve each Ti and the protocol for Ti extends the protocol for Ti. This paper establishes that although each Ti may be solvable, the uniform sequence is not necessarily uniformly solvable. We show this by proposing a novel uniform sequence of solvable tasks and proving that the sequence is not amenable to a uniform solution. We then extend the HS conditions for a task over n processors, to uniform solvability in a natural way. The technique we use to accomplish this is to generalize the alternative algorithmic proof, by Borowsky and Gafni, of the HS conditions, by showing that the infinite uniform sequence of task of Immediate Snapshots is uniformly solvable. A side benefit of the technique is a widely applicable methodology for thedevelopment of uniform protocols.