Randomized dining philosophers without fairness assumption

Distributed Computing

Volumn 17, Issue 1, 2004, Pages 65-76

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

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; PARALLEL PROCESSING SYSTEMS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

RANDOMIZED DINING; SCHEDULING MECHANISMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 1642325485     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-003-0102-z     Document Type: Article

References (20)

1. Beauquier J., Durand-Lose J., Gradinariu M., Johnen C.: Token based self-stabilizing uniform algorithms. Journal of Parallel and Distributed Computing 62(5):899-921 (2002)
2. Beauquier J., Gradinariu M., Johnen C.: Memory space requirements for self-stabilizing leader election protocols. In: Proc. 18th Annual ACM Symposium on Principles of Distributed Computing (PODC'99), pp 199-208. ACM Press (1999)
3. Beauquier J., Gradinariu M., Johnen C.: Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Technical Report 1225, L.R.I., Orsay, France (1999)
4. Bonald T., Massoulié L.: Impact of fairness on internet performance. In: Proc. of Joint Int. Conf. on Measurements and Modeling of Computer Systems (SIGMETRICS/Performance 2001), pp 82-91. ACM (2001)
5. Dijkstra E.W.: Hierarchical ordering of sequential processes. In: Operating Systems Techniques, pp 72-93. Academic Press (1972)
6. Duflot M., Fribourg L., Picaronny C.: Randomized finite-state distributed algorithms as Markov chains. In: Proc. 15th Int. Conf. on Distributed Computing (DISC'01), vol 2180 of LNCS, pp 240-254. Springer (2001)
7. Gevros P., Risso F., Kirstein P.: Analysis of a method for differential TCP service. In: Proc. 4th Symposium on Global Internet (GLOBECOM'99) (1999)
8. Herescu O.M.: The probabilistic asynchronous Pi-calculus. PhD thesis, Department of Computer Science and Engineering, Pennsylvania State University (2002)
9. Kakugawa H., Yamashita M.: Uniform and self-stabilizing token rings allowing unfair daemon. IEEE Trans. Parallel and Distributed Systems 8(2):154-163 (1997)
10. Kemeny J.G., Snell J.L., Knapp A.W.: Denumerable markov chains, van Nostrand Co. (1966)
11. Lynch N.A.: Distributed algorithms. Morgan Kaufmann Publishers (1996)
12. Lynch N.A., Saias I., Segala R.: Proving time bounds for randomized distributed algorithms. In: Proc. 13th Annual ACM Symposium on Principles of Distributed Computing (PODC'94), pp 314-323. ACM Press (1994)
13. McIver A.K.: Quantitative program logic and efficiency in probabilistic distributed algorithms. Technical report, Computing Laboratory, Oxford University, UK (1998) (Extended version of "Quantitative program logic and performance in probabilistic distributed algorithms", Proc. of 5th Int AMAST Workshop, ARTS '99)
14. McIver A.K.: Quantitative program logic and efficiency in probabilistic distributed algorithms. Technical report, Computing Laboratory, Oxford University, UK (1998) (Extended version of "Quantitative program logic and performance in probabilistic distributed algorithms", Proc. of 5th Int AMAST Workshop, ARTS '99)
15. Palamidessi C., Herescu O.M.: A randomized distributed encoding of the pi-calculus with mixed choice. In: Proc. 2nd IFIP Int. Conf. on Theoretical Computer Science (TCS@02), vol 223 of IFIP Conference Proceedings, pp 537-549. Kluwer Academic (2002)
16. Pnueli A., Zuck L.D.: Verification of multiprocess probabilistic protocols. Distributed Computing 1(1):53-72 (1986)
17. Pogosyants A., Segala R.: Formal verification of timed properties for randomized distributed algorithms. In: Proc. 14th Annual ACM Symposium on Principles of Distributed Computing (PODC'95), pp 174-183. ACM Press (1995)
18. Rabin M.O., Lehmann D.J.: The advantages of free choice: a symetric and fully distributed solution for the dining philosophers problem. In: Roscoe A.W. (ed) A classical mind: essays in honour of C.A.R. Hoare, chap 20, pp 333-352. Prentice Hall (1994). (An extended abstract appeared in the Proc. 8th Annual ACM Symposium on Principles of Programming Languages(POPL'81), pp 133-138)
19. Rabin M.O., Lehmann D.J.: The advantages of free choice: a symetric and fully distributed solution for the dining philosophers problem. In: Roscoe A.W. (ed) A classical mind: essays in honour of C.A.R. Hoare, chap 20, pp 333-352. Prentice Hall (1994). (An extended abstract appeared in the Proc. 8th Annual ACM Symposium on Principles of Programming Languages(POPL'81), pp 133-138)
20. Segala R., Lynch N.A.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2(2):250-273 (1995)