Amortized efficiency of list update and paging rules
Communications of the ACM
On achieving consensus using a shared memory
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Fast randomized consensus using shared memory
Journal of Algorithms
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Wait-free data structures in the asynchronous PRAM model
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Randomized wait-free concurrent objects (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Optimal time randomized consensus—making resilient algorithms fast in practice
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Competitive distributed job scheduling (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Concurrent timestamping made simple
ISTCS'92 Symposium proceedings on Theory of computing and systems
Atomic snapshots of shared memory
Journal of the ACM (JACM)
Time- and space-efficient randomized consensus
Journal of Algorithms
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Linear programming without the matrix
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Wait-Free Consensus Using Asynchronous Hardware
SIAM Journal on Computing
Lower bounds on the competitive ration for mobile user tracking and distributed job scheduling
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
A theory of clock synchronization (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Competitive algorithms for distributed data management
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Simple atomic snapshots: a linear complexity solution with unbounded time-stamps
Information Processing Letters
Randomized Consensus in Expected O(n log^ 2 n) Operations Per Processor
SIAM Journal on Computing
Bounded Concurrent Time-Stamping
SIAM Journal on Computing
Efficient asynchronous consensus with the weak adversary scheduler
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Atomic Snapshots in O (n log n) Operations
SIAM Journal on Computing
Spreading rumors rapidly despite an adversary
Journal of Algorithms
Distributed paging for general networks
Journal of Algorithms
Using knowledge to optimally achieve coordination in distributed systems
Theoretical Computer Science
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
Journal of the ACM (JACM)
SIAM Journal on Computing
Optimal Clock Synchronization Under Different Delay Assumptions
SIAM Journal on Computing
A Characterization of Eventual Byzantine Agreement
SIAM Journal on Computing
SIAM Journal on Computing
Sacrificing serializability to attain high availability of data in an unreliable network
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Randomized Consensus in Expected O(n²log n) Operations
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
A Concurrent Time-Stamp Scheme which is Linear in Time and Space
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Competitive Analysis of Distributed Algorithms
Developments from a June 1996 seminar on Online algorithms: the state of the art
Atomic snapshots using lattice agreement
Distributed Computing
Distributed Computing
Common knowledge and consistent simultaneous coordination
Distributed Computing
Distributed Computing
Hi-index | 0.00 |
We define a measure of competitive performance for distributed algorithms based on throughput, the number of tasks that an algorithm can carry out in a fixed amount of work. This new measure complements the latency measure of Ajtai et al. [A theory of competitive analysis for distributed algorithms, in: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, IEEE, 1994, pp. 401-411]. which measures how quickly an algorithm can finish tasks that start at specified times. The novel feature of the throughput measure, which distinguishes it from the latency measure, is that it is compositional: it supports a notion of algorithms that are competitive relative to a class of subroutines, with the property that an algorithm that is k-competitive relative to a class of subroutines, combined with an l-competitive member of that class, gives a combined algorithm that is kl-competitive.In particular, we prove the throughput-competitiveness of a class of algorithms for collect operations, in which each of a group of n processes obtains all values stored in an array of n registers. Collects are a fundamental building block of a wide variety of shared-memory distributed algorithms, and we show that several such algorithms are competitive relative to collects. Inserting a competitive collect in these algorithms gives the first examples of competitive distributed algorithms obtained by composition using a general construction.