An optimal distributed solution to the dining philosophers problem |
| |
| Authors: | S. P. Rana D. K. Banerji |
| |
| Affiliation: | (1) Department of Computer Science, Wayne State University, 48202 Detroit, MI;(2) Department of Computing and Information Science, University of Guelph, N1G 2W1 Guelph, Ontario |
| |
| Abstract: | ![]()
An optimal distributed solution to the dining philosophers problem is presented. The solution is optimal in the sense that it incurs the least communication and computational overhead, and allows the maximum achievable concurrency. The worst case upper bound for concurrency is shown to ben div 3,n being the number of philosophers. There is no previous algorithm known to achieve this bound. |
| |
| Keywords: | Dining philosophers distributed algorithms concurrency performance analysis resource allocation |
| 本文献已被 SpringerLink 等数据库收录！ |
|
