Oltea Mihaela Herescu, Catuscia Palamidessi  Home/Search
Context Related
| lamp.epfl.ch/~uwe/...herescupodc.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lamp.epfl.ch/~uwe/citations/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider a generalization of the dining philosophers problem to arbitrary connection topologies. We focus on symmetric, fully distributed systems, and we address the problem of guaranteeing progress and lockout-freedom, even in presence of adversary schedulers, by using randomized algorithms. We show that the well-known algorithms of Lehmann and Rabin do not work in the generalized case, and we propose an alternative algorithm based on the idea of letting the philosophers assign a random... (Update)
Context of citations to this paper: More
...the expected time of convergence as a number of transitions. We have shown that this time may be exponential for some malicious scheduler. An interesting further work would be to remove the fairness assumption with more complex connection topologies of dining philosophers as, e.g. in...
Cited by: More
Randomized Dining Philosophers without Fairness Assumption - Duflot, Fribourg, Picaronny (2002) (Correct)
Similar documents (at the sentence level):
56.3%: The Probabilistic Asynchronous π-Calculus - Herescu (2002) (Correct)
Active bibliography (related documents): More All
0.1: Alea jacta est - Verification of Probabilistic, Real-Time and.. - Stoelinga (2002) (Correct)
0.1: A Randomized Encoding of the π-Calculus with Mixed Choice - Palamidessi, Herescu (2001) (Correct)
0.1: A Randomized Distributed Encoding of the π-Calculus.. - Palamidessi, Herescu (2002) (Correct)
Similar documents based on text: More All
0.9: A Modular Drinking Philosophers Algorithm - Welch, Lynch (2001) (Correct)
0.8: Software Methodologies for VHDL Code Static Analysis.. - Baresi, Bolchini, Sciuto (1996) (Correct)
0.8: Synthesis Of Efficient Drinking Philosophers Algorithms - Welch, Lynch (1989) (Correct)
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/herescu01generalized.html More
@misc{ herescu01generalized,
author = "O. Herescu and C. Palamidessi",
title = "the Generalized Dining Philosophers Problem",
text = "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.",
year = "2001",
url = "citeseer.ist.psu.edu/herescu01generalized.html" }
Citations (may not include all citations):854 Information and Computation (context) - Milner, Parrow et al. - 1992
200 Pict: A programming language based on the pi-calculus - Pierce, Turner - 1998
174 Probabilistic simulations for probabilistic processes - Segala, Lynch - 1995
90 Modeling and Verification of Randomized Distributed Real-Tim.. (context) - Segala - 1995
83 Hierarchical ordering of sequential processes (context) - Dijkstra - 1971
73 Comparing the expressive power of the synchronous and the as.. - Palamidessi - 1997
57 the advantages of free choice: A symmetric and fully distrib.. (context) - Rabin, Lehmann - 1994
37 Proving time bounds for randomized distributed algorithms - Lynch, Saias et al. - 1994
19 good' encoding of guarded choice (context) - Nestmann - 1997
13 A distributed abstract data type implemented by a probabilis.. (context) - Francez, Rodeh - 1980
8 Probabilistic asynchronous -calculus (context) - Herescu, Palamidessi - 2000
Documents on the same site (http://lamp.epfl.ch/~uwe/citations/): More
Asynchronous process calculi: the first-order and higher-order.. - Sangiorgi (1999) (Correct)
Comparing the Expressive Power of the Synchronous and the.. - Palamidessi (1997) (Correct)
Types for Access Control - De Nicola, Ferrari, Pugliese, Venneri (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC