Abstract
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.
The work presented in this paper was supported by the National Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS), a center supported by the Swiss National Science Foundation under grant number 5005-67322 and by the Federal Office for Education and Science (OFES) for the PALCOM IST project (Framework VI), under grant number 03.0495-1. Roberto Baldoni has been partially supported by the ministry of the italian universities and research (MIUR) in the context of the project IS-MANET.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. Attiya and J. Welch. Distributed Computing. McGraw-Hill, 1998.
S. Baehni, R. Baldoni, R. Guerraoui, and B. Pochon. The Driving Philosophers. Technical Report IC/2004/15, EPFL, Lausanne, 2004.
V. Barbosa and E. Gafni. Concurrency in heavily loaded neighborhood-constrained systems. ACM Transactions on Programming Languages and Systems, 11(4):562–584, 1989.
M. Benchaïba, A. Bouabdallah, N. Badache, and M. Ahmed-Nacer. Distributed mutual exclusion algorithms in mobile ad-hoc networks. ACM Operating Systems Review, 38(1):74–89, January 2004.
K. M. Chandy and J. Misra. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems, 6(4):632–646, 1984.
E. W. Dijkstra. Hierarchical ordering of sequential processes. Acta Informatica, 1(2): 115–138, 1971.
D. Estrin, R. Govindan, and J. Heidemann. Embedding the internet. Communication of the ACM, 43(5):39–41, 2000.
M. Fischer, N. Lynch, J. Burns, and A. Borodin. Resource allocation with immunity to limited process failure. In IEEE Symposium on Foundations of Computer Science, pages 234–254, 1979.
N. Garg, M. Papatriantafilou, and P. Tsigas. Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks. ACM Wireless Network, 8(1):49–60, 2002.
R. Grossi, A. Pietracaprina, and G. Pucci. Optimal deterministic protocols for mobile robots on a grid. Information and Computation, 173:132–142, 2002.
Y. Joung. Asynchronous group mutual exclusion. In Proceedings of the 17 th ACM Symposium on Principles of Distributed Computing (PODC’98) pages 51–60, 1998.
L. Lamport. The mutual exclusion problem. Journal of the ACM, 33(2):313–348, 1985.
L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1): 1–11, February 1987.
N. A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
M. Merritt and G. Taubenfeld. Resilient consensus for infinitely many processes. In Proceedings of the 17 th International Symposium on Distributed Computing (DISC’03), pages 1–15, October 2003.
J. Walter, J. Welch, and N. Vaidya. A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks, 9(6):585–600, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science + Business Media, Inc.
About this paper
Cite this paper
Baehni, S., Baldoni, R., Guerraoui, R., Pochon, B. (2004). The Driving Philosophers. In: Levy, JJ., Mayr, E.W., Mitchell, J.C. (eds) Exploring New Frontiers of Theoretical Informatics. IFIP International Federation for Information Processing, vol 155. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8141-3_16
Download citation
DOI: https://doi.org/10.1007/1-4020-8141-3_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8140-8
Online ISBN: 978-1-4020-8141-5
eBook Packages: Springer Book Archive