Sciweavers

246 search results - page 50 / 50
» A Proof System for Asynchronously Communicating Deterministi...
Sort
View
SPAA
2009
ACM
14 years 5 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch