Randomized dining philosophers without fairness assumption

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 169-180

  Duflot, Marie ^a   Fribourg, Laurent ^a   Picaronny, Claudine ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; SCHEDULING;

DINING PHILOSOPHERS; EXPECTED TIME; MODIFIED ALGORITHMS; ORIGINAL ALGORITHMS; RANDOMIZED SOLUTIONS;

PHILOSOPHICAL ASPECTS;

EID: 84891045031     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_15     Document Type: Article

References (14)

1. T. Bonald and L. Massouli. Impact of fairness on Internet performance. In Proc. of Joint International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS/Performance 2001), Cambridge, USA, 2001, pp. 82-91.
2. J. Beauquier, J. Durand-Lose, M. Gradinariu, and C. Johnen. Token based self-stabilizing uniform algorithms. J. of Parallel and Distributed Systems, To appear.
3. S. Dolev, A. Israeli, and S. Moran. Analyzing expected time by scheduler-luck games. IEEE Transactions on Software Engineering, 21(5), 1995, pp. 429-439.
4. M. Duflot, L. Pribourg, and C. Picaronny. Randomized distributed algorithms as Markov chains. In Proc. 15th Int. Conf. on Distńbuted Computing (DISC'01), Lisbon, 2001, pp. 240-254. (Extended version available on http://www.lsv.ens-cachan.fr/Publis/).
5. M. Duflot, L. Fribourg, and C. Picaronny. Randomized dining philosophers without fairness assumption. Research Report LSV-01-11, Cachan, France, December 2001. Available on http://www.lsv.ens-cachan.fr/Publis
6. P. Gevros, F. Risso, and P. Kirstein. Analysis of a Method for Differential TCP Service. In Proc. of the IEEE GLOBECOM'99, Rio de Janeiro, 1999.
7. H. Kakugawa and M. Yamashita. Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon. IEEE Trans. Parallel and Distributed Systems, 8(2), 1997, pp. 154-163.
8. D. Lehmann and M.O. Rabin. The advantages of free choice: a symmetric and fully-distributed solution to the dining philosophers problem. In Proc. 8th Annual ACM Symposium on Principles of Programming Languages(POPL}81), Williams-burg, U.S.A., 1981, pp. 133-138.
9. N.A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., 1996.
10. N.A. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proc. 13th Annual ACM Symposium on Principles of Distributed Computing (PODC'94), Los Angeles, USA, 1994, pp. 314-323.
11. A.K. Mclver. Quantitative program logic and efficiency in probabilistic distributed algorithms. Tech. report, Computing Lab., Oxford U., UK, 1998. (Extended version of Quantitative program logic and performance, Proc. of 5th Int AMAST Workshop, ARTS '99).
12. O.M. Herescu and C. Palamidessi. On the Generalized Dining Philosophers Problem. In Proc. 20th Annual ACM Symposium on Principles of Distributed Computing (PODC'01), Newport, USA, 2001, pp. 81-89.
13. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Dis-tributed Computing, 1(1), 1986, pp. 53-72.
14. A. Pogosyants and R. Segala. Formal verification of timed properties for randomized distributed algorithms. In Proc. 14th Annual ACM Symposium on Principles of Distributed Computing (PODC'95), Ontario, Canada, 1995, pp. 174-183.