This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Termination Detection Protocols for Mobile Distributed Systems
June 2001 (vol. 12 no. 6)
pp. 558-566

Abstract—This paper studies a fundamental problem, the termination detection problem, in distributed systems. Under a wireless network environment, we show how to handle the host mobility and disconnection problems. In particular, when some distributed processes are temporarily disconnected, we show how to capture a weakly terminated state where silence has been reached only by those currently connected processes. A user may desire to know such a state to tell whether the mobile distributed system is still running or is silent because some processes are disconnected. Our protocol tries to exploit the network hierarchy by combining two existing protocols together. It employs the weight-throwing scheme [9], [16], [21] on the wired network side, and the diffusion-based scheme [5], [13] on each wireless cell. Such a hybrid protocol can better pave the gaps of computation and communication capability between static and mobile hosts, thus more scalable to larger distributed systems. Analysis and simulation results are also presented.

[1] S. Alagar, R. Rajagopalan, and S. Venkatesan, “Tolerating Mobile Support Station Failures,” Proc. Int'l Conf. Fault-Tolerant Systems, 1995.
[2] S. Alagar and S. Venkatesan, “Causal Ordering in Distributed Mobile Systems,” IEEE Trans. Computers, vol. 46, no. 3, pp. 353-361, Mar. 1997.
[3] A. Archarys and B.R. Badrinath, “A Framework for Delivering Multicast Messages in Networks with Mobile Hosts,” ACM/Baltzer J. Mobile Networks and Applications, vol. 1, no. 2, pp. 199-219, 1996.
[4] S. Chandrasekaran and S. Venkatesan, "A Message-Optimal Algorithm for Distributed Termination Detection," J. Parallel and Distributed Computing, vol. 8, pp. 245-252, 1990.
[5] E.W. Dijkstra and C.S. Scholten, “Termination Detection for Diffusing Computations,” Information Processing Letters, vol. 11, pp. 1-4, 1980.
[6] N. Francez and M. Rodeh, “Achieving Distributed Termination Without Freezing,” IEEE Trans. Software Engr., vol. 8, no. 3, pp. 287-292, 1982.
[7] J. Geier, Wireless Networking Handbook. Indianapolis: New Riders Publishing, 1996.
[8] A. Hills and D.B. Johnson, “Wireless Data Network Infrastructure at Carnegie Mellon University,” IEEE Personal Comm., vol. 3, no. 1, Feb. 1996.
[9] S.T. Huang, "Detecting Termination of Distributed Computations by External Agents," Proc. Ninth Int'l Conf. Distributed Computing Systems, pp. 79-84, 1989.
[10] S.T. Huang, ”A Distributed Deadlock Detection Algorithm for CSP-Like Communication,” ACM Trans. Programming Language and Systems, vol. 12, no. 1, pp. 102-122, Jan. 1990.
[11] L. Kleinrock, “Nomadic Computing—An Opportunity,” ACM Computer Comm. Review, pp. 36-40, year???
[12] P. Krishna, N. Vaidya, and D. Pradhan, "Recovery in Distributed Mobile Environments," Proc. Workshop Advances in Parallel and Distributed Systems, pp. 83-88,Princeton, N.J., 1993.
[13] T.-H. Lai, Y.-C. Tseng, and X. Dong, “A More Efficient Message-Optimal Algorithm for Distributed Termination Detection,” Int'l Parallel Processing Symp., pp. 646-649, 1992.
[14] T.-H. Lai and L.-F. Wu, “An$(n-1)$-Resilient Algorithm for Distributed Termination Detection,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 1, pp. 63-78, Jan. 1995.
[15] B.P. Lester, The Art of Parallel Programming. Prentice Hall, 1993.
[16] F. Mattern, “Golbal Quiescence Detection Based on Credit Distribution and Recovery,” Information Processing Letters, vol. 30, pp. 195-200, 1989.
[17] J. Misra and K.M. Chandy, “Termination Detection of Diffusing Computations in Communicating Sequential Processes,” ACM Trans. Programming Language and Systems, vol. 4, no. 1, pp. 37-43, Jan. 1982.
[18] R. Prakash, M. Raynal, and M. Singhal, "An Efficient Causal Ordering Algorithm for Mobile Computing Environments," Proc. 16th Int'l Conf. Distributed Computing Systems,Hong Kong, 1996.
[19] R. Prakash and M. Singhal, "Low-Cost Checkpointing and Failure Recovery in Mobile Computing Systems," IEEE Trans. Parallel and Distributed System, vol. 7, no. 10, pp. 1,035-1,048, Oct. 1996.
[20] M. Singhal and N.G. Shivaratri, Advanced Concepts in Operation Systems: Distributed, Database, and Multiprocessor Operating Systems. McGraw-Hill, 1994.
[21] Y.-C. Tseng, “Detecting Termination by Weight-Throwing in a Faulty Distributed System,” J. Parallel and Distributed Computing, vol. 25, pp. 7-15, 1995.
[22] S. Venkatesan, “Reliable Protocols for Distributed Termination Detection,” IEEE Trans. Reliability, vol. 38, no. 1, pp. 103-110, Apr. 1989.
[23] Y. Sato et al. “A Snapshot Algorithm for Distributed Mobile Systems,” Int'l Conf. Distributed Computing Systems, pp. 734-743, 1996.
[24] L.-H. Yen, T.-L. Huang, and S.-Y. Hwang, “A Protocol for Casually Ordered Message Delivery in Mobile Computing Systems,” Mobile Networks and Applications, vol. 2, no. 4, pp. 365-372, 1997.

Index Terms:
Distributed computing, distributed protocol, mobile computing, operating system, termination detection, wireless network.
Citation:
Yu-Chee Tseng, Cheng-Chung Tan, "Termination Detection Protocols for Mobile Distributed Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 6, pp. 558-566, June 2001, doi:10.1109/71.932710
Usage of this product signifies your acceptance of the Terms of Use.