The Driving Philosophers

We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a round-about (set of shared resources organized along a logical ring). The crux of the problem is to ensure, beside traditional mutual exclusion and starvation freedom at each particular resource, gridlock freedom (i.e., a cyclic waiting chain among processes). The problem captures explicitly the very notion of process mobility and the underlying model does not involve any assumption on the total number of (participating) processes or the use of shared memory, i.e., the model conveys the ad-hoc environment. We present a generic algorithm that solves the problem in a synchronous model. Instances of this algorithm can be fair but not concurrent, or concurrent but not fair.W e derive the impossibility of achieving fairness and concurrency at the same time as well as the impossibility of solving the problem in an asynchronous model. We also conjecture the impossibility of solving the problem in an ad-hoc network model with limited-range communication.

[1]  Allan Borodin,et al.  Resource allocation with immunity to limited process failure , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  BenchaïbaM.,et al.  Distributed mutual exclusion algorithms in mobile ad hoc networks , 2004 .

[3]  Nitin H. Vaidya,et al.  A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks , 2001, Wirel. Networks.

[4]  Yuh-Jzer Joung,et al.  Asynchronous group mutual exclusion , 2000, Distributed Computing.

[5]  K. Mani Chandy,et al.  The drinking philosophers problem , 1984, ACM Trans. Program. Lang. Syst..

[6]  Michael Merritt,et al.  Resilient Consensus for Infinitely Many Processes , 2003, DISC.

[7]  Eli Gafni,et al.  Concurrency in heavily loaded neighborhood-constrained systems , 1989, ICDCS.

[8]  Marina Papatriantafilou,et al.  Distributed Long-Lived List Colouring: How to Dynamically Allocate Frequencies in Cellular Networks , 2002, Wirel. Networks.

[9]  Hakan Deliç,et al.  Packet Reservation Window Multiple Access for Microcellular Voice/Data Transmission , 2003, Wirel. Networks.

[10]  Yuh-Jzer Joung,et al.  Asynchronous group mutual exclusion (extended abstract) , 1998, PODC '98.

[11]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[12]  Richard S. Varga,et al.  Proof of Theorem 5 , 1983 .

[13]  Deborah Estrin,et al.  Embedding the Internet , 2000 .

[14]  Leslie Lamport,et al.  A fast mutual exclusion algorithm , 1987, TOCS.

[15]  Deborah Estrin,et al.  Embedding the Internet: introduction , 2000, Commun. ACM.

[16]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[17]  Thomas H. Bredt.  The mutual exclusion problem , 1970 .

[18]  R. Varga,et al.  Proof of Theorem 4 , 1983 .

[19]  Edsger W. Dijkstra,et al.  Hierarchical ordering of sequential processes , 1971, Acta Informatica.

[20]  Kenneth E. Murphy,et al.  Enterprise resource planning: integrating ERP in the business school curriculum , 2000, CACM.

[21]  Abdelmadjid Bouabdallah,et al.  Distributed mutual exclusion algorithms in mobile ad hoc networks: an overview , 2004, OPSR.

[22]  Leslie Lamport,et al.  The mutual exclusion problem: part I—a theory of interprocess communication , 1986, JACM.

[23]  Geppino Pucci,et al.  Optimal Deterministic Protocols for Mobile Robots on a Grid ∗ , 2003 .