A distributed load-balancing policy for a multicomputer
Software—Practice & Experience
A Distributed Drafting Algorithm for Load Balancing
IEEE Transactions on Software Engineering
Efficient synchronization of multiprocessors with shared memory
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Two algorithms for barrier synchronization
International Journal of Parallel Programming
The token distribution problem
SIAM Journal on Computing
Algorithms for parallel memory allocation
International Journal of Parallel Programming
Adaptive backoff synchronization techniques
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
The periodic balanced sorting network
Journal of the ACM (JACM)
Counting networks and multi-processor coordination
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Low contention linearizable counting
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Counting networks with arbitrary fan-out
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Low contention load balancing on large-scale multiprocessors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A lower bound on wait-free counting
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Contention in shared memory algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Notes on Sorting and Counting Networks (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Contention in counting networks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A combinatorial treatment of balancing networks
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Counting networks are practically linearizable
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The strength of counting networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Public data structures: counters as a special case
Theoretical Computer Science
Linearizable counting networks
Distributed Computing
Counting networks with arbitrary fan-out
Distributed Computing
| Hi-index | 0.00 |