Proceedings 21st International Conference on Distributed Computing Systems (2001)
Apr. 16, 2001 to Apr. 19, 2001
Patrick Keane , Danet, Inc.
Mark Moir , Sun Microsystems Laboratories
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.
P. Keane and M. Moir, "A General Resource Allocation Synchronization Problem," Proceedings 21st International Conference on Distributed Computing Systems(ICDCS), Mesa, AZ, 2001, pp. 0557.