This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Timed Asynchronous Distributed System Model
June 1999 (vol. 10 no. 6)
pp. 642-657

Abstract—We propose a formal definition for the timed asynchronous distributed system model. We present extensive measurements of actual message and process scheduling delays and hardware clock drifts. These measurements confirm that this model adequately describes current distributed systems such as a network of workstations. We also give an explanation of why practically needed services, such as consensus or leader election, which are not implementable in the time-free model, are implementable in the timed asynchronous system model.

[1] Y. Amir and A. Wool, “Evaluating Quorum Systems over the Internet,” Proc. 26th Int'l Symp. Fault-Tolerant Computing, Sendai, Japan, pp. 26–35, June 1996.
[2] T.D. Chandra, V. Hadzillacos, S. Toueg, and B. Charron-Bost, “On the Impossibility of Group Membership,” Proc. 15th ACM Symp. Principles of Distributed Computing, pp. 322–330, 1996.
[3] T.D. Chandra and S. Toueg, "Unreliable Failure Detectors for Asynchronous Systems," Proc. 10th ACM Symp. Principles of Distributed Computing, pp. 325-340, Aug. 1991.
[4] F. Cristian, “Probabilistic Clock Synchronization,” Distributed Computing, pp. 3:146–158, 1989.
[5] F. Cristian, "Understanding Fault-Tolerant Distributed Systems," Comm. ACM, vol. 34, no. 2, Feb. 1991.
[6] F. Cristian, "Group, Majority, and Strict Agreement in Timed Asynchronous Distributed Systems," Proc. 26th Int'l Symp. Fault-Tolerant Computing, June 1996.
[7] F. Cristian, “Synchronous and Asynchronous Group Communication,” Comm. ACM, vol. 39, no. 4, pp. 88-97, 1996.
[8] F. Cristian, H. Aghili, R. Strong, and D. Dolev, “Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement,” Proc. 15th Int'l Symp. Fault-Tolerant Computing, pp. 200–206, Ann Arbor, Mich., June 1985.
[9] F. Cristian, S. Mishra, and Y. Hyun, “Implementation and Performance of a Stable Storage Service for Unix,” Proc. 15th Symp. Reliable Distributed Systems, pp. 86–95, Niagara-on-the-Lake, Canada, Oct. 1996.
[10] F. Cristian and F. Schmuck, “Agreeing on Processor-Group Membership in Asynchronous Distributed Systems,” Technical Report CSE95-428, Dept. of Computer Science and Eng., Univ. of California, San Diego, 1995.
[11] C. Dwork, N. Lynch, and L. Stockmeyer, “Consensus in the Presence of Partial Synchrony,” J. ACM. vol. 35, no. 2, pp. 288–323, Apr. 1988.
[12] D. Essame, J. Arlat, and D. Powell, “Padre: A Protocol for Asymmetric Duplex Redundancy,” Proc. Seventh IFIP Int'l Working Conf. Dependable Computing for Critical Applications, San Jose, Calif., Jan. 1999.
[13] C. Fetzer and F. Cristian, “A Highly Available Local Leader Service,” IEEE Trans. Software Eng., to appear in 1999. Also available as
[14] C. Fetzer and F. Cristian, “On the Possibility of Consensus in Asynchronous Systems,” Proc. 1995 Pacific Rim Int'l Symp. Fault-Tolerant Systems, Newport Beach, Calif., Dec. 1995. Also available ashttp://www. cs. ucsd. edu/~cfetzer/HALL.http:/ /www.cs.ucsd.edu/~cfetzerCONS.
[15] C. Fetzer and F. Cristian, “Fail-Awareness in Timed Asynchronous Systems,” Proc. 15th ACM Symp. Principles of Distributed Computing, pp. 314–321a, Philadelphia, May 1996. Also available as
[16] C. Fetzer and F. Cristian, “A Fail-Aware Membership Service,” Proc. 16th Symp. Reliable Distributed Systems, pp. 157-164, Oct. 1997.
[17] C. Fetzer and F. Cristian, “Fail-Awareness: An Approach to Construct Fail-Safe Applications,” Proc. 27th Ann. Int'l Symp. Fault-Tolerant Computing, Seattle, June 1997. Also available as
[18] C. Fetzer and F. Cristian, “Fortress: A System to Support Fail-Aware Real-Time Applications,” IEEE Workshop Middleware for Distributed Real-Time Systems and Services, San Francisco, Dec. 1997. Also available ashttp://www.cs.ucsd.edu/users/~cfetzer/FA.http:/ /www.cs.ucsd.edu/users/~cfetzer/ FAPS.http://www.cs.ucsd.edu/users/cfetzer FORTRESS.
[19] C. Fetzer and F. Cristian, “A Fail-Aware Datagram Service,” Fault-Tolerant Parallel And Distributed Systems, D. Avaresky and D. Kaeli, eds., chapter 3, pp. 55–69. Kluwer Academic Publishers, 1998. Also available ashttp://www.cs.ucsd.edu/~cfetzerFADS.
[20] C. Fetzer and F. Cristian, “Building Fault-Tolerant Hardware Clocks,” Proc. Seventh IFIP Int'l Working Conf. Dependable Computing for Critical Applications, San Jose, Calif., Jan 1999. Also available as
[21] M.J. Fischer, N.A. Lynch, and M.S. Paterson, “Impossibility of Distributed Consensus with One Faulty Process,” J. ACM, vol. 32, no. 2, pp. 374i–382, 1985.
[22] C. Gray and D. Cheriton, "Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency," Proc. 12th Int'l Symp. Operating System Principles, 1989.
[23] L. Lamport and N. Lynch, “Distributed Computing: Models and Methods,” Handbook of Theoretical Computer Science, pp. 1,158–1,199. Elsevier Science Publishers, 1990
[24] J. Lundelius Welch, “Simulating Synchronous Processors,” Information and Computation, vol. 74, no. 2, pp. 159–171, Aug. 1987.
[25] D.L. Mills, “Internet Time Synchronization: The Network Time Protocol,” IEEE Trans. Comm., vol. 39, no. 10, pp. 1,482–1,493, Oct. 1991.
[26] D.L. Mills, “Modelling and Analysis of Computer Network Clocks,” Technical Report 92-5-2, Univ. of Delaware, Electrical Eng. Dept., May 1992.
[27] G. Neiger and S. Toueg, “Simulating Synchronized Clocks and Common Knowledge in Distributed Systems,” J. ACM, vol. 40, no. 2, pp. 334–67, Apr. 1993.
[28] D. Powell, Failure Mode Assumptions and Assumption Coverage Proc. 22nd Int'l Symp. Fault-Tolerant Computing (FTCS-22), pp. 386-395, 1992.
[29] L. Sabel and K. Marzullo, “Election vs. Consensus in Asynchronous Systems,” Technical Report TR95-1488, Cornell Univ., Feb. 1995.
[30] B. Schneier, Applied Cryptography. John Wiley, 1996.
[31] P. Verissimo and C. Almeida, “Quasi-Synchronism: A Step Away from the Traditional Fault-tolerant Real-time System Models,” IEEE TCOS Bulletin, vol. 7, no. 4, Dec. 1995.
[32] P. Verissimo, L. Rodrigues, and M. Baptista, “Amp: A Highly Parallel Atomic Multicast Protocol,” SIGCOMM '89, pp. 83–93, Austin, Tex., Sept. 1989.

Index Terms:
Timed model, system model, failure model, distributed systems, asynchronous systems, synchronous systems, measurements, communication by time.
Citation:
Flaviu Cristian, Christof Fetzer, "The Timed Asynchronous Distributed System Model," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 6, pp. 642-657, June 1999, doi:10.1109/71.774912
Usage of this product signifies your acceptance of the Terms of Use.