Parallel program design: a foundation
Parallel program design: a foundation
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Efficient fault tolerant algorithms for resource allocation in distributed systems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A bounded first-in, first-enabled solution to the l-exclusion problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Coordinating first-order multiparty interactions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A simple local-spin group mutual exclusion algorithm
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Toward a theory of maximally concurrent programs (shortened version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Transparent Support for Wait-Free Transactions
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Achievable cases in an asynchronous environment
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A dining philosophers algorithm with polynomial response time
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Self-stabilizing atomicity refinement allowing neighborhood concurrency
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
| Hi-index | 0.00 |
Abstract: We introduce a new synchronization problem called GRASP. We show that this problem is very general, in that it can provide solutions with strong properties to a wide range of previously-studied and new problems. We present a shared-memory solution to this problem that is based on a new solution to the Dining Philosophers problem with constant failure locality. We use the powerful tool of wait-free transactions to simplify our solution without restricting concurrency.