Distributed Algorithms with Dynamical Random Transitions

Random Structures and Algorithms

Volumn 21, Issue 3-4, 2002, Pages 371-396

  Guillotin Plantard, Nadine ^a   Schott, René ^b  

^a UNIVERSITÉ LYON 1   (France)

^b UNIVERSITÉ HENRI POINCARÉ NANCY 1   (France)

Author keywords

Banker algorithm; Dynamical random walls; Dynamical systems; Resource sharing

Indexed keywords

EID: 0036439475     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10060     Document Type: Conference Paper

References (21)

1. P. Billingsley, Convergence of probability measures, Wiley: New York, 1968.
2. J. Descloux and M. Tolley, An accurate algorithm for computing the eigenvalues of polygonal membrane, Comput Methods Appl Mech Eng 39 (1983), 37-53.
3. C. A. Ellis, Probabilistic model of computer deadlock, Inform Sci 12 (1977), 43-60.
4. W. Feller, Introduction to probability theory and its applications, Wiley, New York (1971), Vol. II.
5. P. Flajolet, The evolution of two stacks in bounded space and random walks in a triangle, Proc MFCS'86 Lecture Notes in Computer Science 233, Springer-Verlag, New York, 1986, pp. 325-340.
6. N. Guillotin, Asymptotics of a dynamic random walk in a random scenery I. A law of large numbers, Ann Inst Poincaré Probab Stat 36(2) (2000), 127-151.
7. N. Guillotin, Asymptotics of a dynamic random walk in a random scenery II. A functional limit theorem, Markov Process Related Fields 5(2) (1999), 201-218.
8. d-random walks in a random scenery: A strong law of large numbers, J Theor Probab 14 (2001), 241-260.
9. A. N. Haberman, System deadlocks, K. M. Chandy and R. T. Yeh, (Editors), Prentice-Hall, Englewood Cliffs, NJ, 1978, Vol. 3, Chap. 7, pp. 256-297.
10. C. Knessl, B. J. Matkowsky, Z. Schuss, and C. Tier, An asymptotic theory of large deviations for Markov jump processes, SIAM J Appl Math 46 (1985), 1006-1028.
11. D. E. Knuth, The art of computer programming, Addison-Wesley, Reading, MA, 1973, Vol. 1.
12. L. Kuipers and H. Niederreiter, Uniform distribution of sequences, Wiley, New York, 1974.
13. G. Louchard, Some distributed algorithms revisited, Commun Stat Stochast Models 11(4) (1995), 563-586.
14. G. Louchard and R. Schott, Probabilistic analysis of some distributed algorithms, Random struct Alg 2(2) (1991), 151-186.
15. G. Louchard, R. Schott, M. Tolley, and P. Zimmermann, Random walks, heat equations and distributed algorithms, J Comput Appl Math 53 (1994), 243-274.
16. R. S. Maier, Colliding stacks: A large deviations analysis, Random Struct Alg 2(2) (1991), 379-420.
17. R. S. Maier and R. Schott, Exhaustion of shared memory: Stochastic results, Proc WADS'93, (1993), Lecture Notes in Computer Science 709, Springer-Verlag, New York, 1993, pp. 494-505.
18. T. Naeh, M. M. Klosek, B. J. Matkowsky, and Z. Schuss, A direct approach to the exit problem, SIAM J Appl Math 50 (1990), 595-627.
19. F. C. Osgood, Diophantine approximation and its applications, Academic, New York, 1973.
20. A. C. Yao, An analysis of a memory allocation scheme for implementing stacks, SIAM J Comput 10 (1981), 398-403.
21. J. C. Yoccoz, Sur la disparition de la propriété de Denjoy-Koksma en dimension 2, Astérique 231 (1995), 215-224.