Title :
Variations on the drinking philosophers algorithm
Author :
Chern, S.E. ; Jacob, R.T. ; Page, I.P.
Author_Institution :
Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA
Abstract :
These variations on Chandy and Micro´s drinking philosophers algorithm (1984) are presented. The objective is to minimize the number of forks that must be collected before a thirsty process may drink, thus reducing the delay incurred in collecting resources before entering a critical section
Keywords :
concurrency control; distributed processing; graph theory; parallel algorithms; critical section; drink; drinking philosophers algorithm; forks; resource collecting; thirsty process; Computer science; Delay; Humans; Jacobian matrices; Postal services; Protection; System recovery;
Conference_Titel :
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2087-0
DOI :
10.1109/SPDP.1990.143627
