Distributed Real-Time Processing
Design issues raised by the achievement of safeness, liveness and timeliness properties for distributed real-time computing systems are first investigated. This is accomplished through an overview of problems and known solutions related to faults/intrusions, variable delays, concurrency, global physical time, process scheduling and through an examination of interdependences which exist between problems and of possibly conflicting or complementary approaches embedded in known solutions. Examples of such interdependencies and conflicting or complementary solutions are given.
These design issues are then investigated in greater detail for a particular class of processing functions, that is, interprocess communications. Merits and limitations of various algorithms utilized to achieve atomic and reliable message transfers, end-to- end flow control and time-constrained message scheduling are identified. Special attention is given to the multiaccess control problem in local area networks where finite bounded message transfer delays must be guaranteed.
KeywordsMicrowave Expense Lution Allo Guaran
Unable to display preview. Download preview PDF.
- 4.Cristian, F. et al., “Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement,” Proc. 15th Symposium on Fault-Tolerant Computing, June 1985, pp. 200–206.Google Scholar
- 5.Denaro, R.P., “Navstar Global Positioning System Offers Unprecedented Navigational Accuracy,” Microwave Systems News and Communications Technology, Vol. 14, November 1984, pp. 54 – 83.Google Scholar
- 6.Denning, D.E., “Protecting Public Keys and Signature Keys,” IEEE Comput., Vol. 16, No. 2, February 1983, pp. 27–35.Google Scholar
- 7.Dolev, D. et al., “On the Possibility and Impossibility of Achieving Clock Synchronization,” Proc. 16th Annual ACM Symposium on Theory of Computing, ACM, April 1985, pp. 504–511.Google Scholar
- 13.Halpern, J. et al., “An Efficient Fault-Tolerant Algorithm for Clock Synchronization,” IBM Technical Report RJ-4094, IBM T.J. Watson Research Center, New York, 1983.Google Scholar
- 18.Laprie, J.C., “Dependable Computing and Fault-Tolerance: Concepts and Terminology,” Proc. 15th Symposium on Fault-Tolerant Computing, June 1985, pp. 2–11.Google Scholar
- 19.Le Lann, G., “Distributed Systems - Towards a Formal Approach,” IFIP Congress, August 1977, North-Holland, Amsterdam, pp. 155–160.Google Scholar
- 20.Le Lann, G., “A Distributed System for Real-Time Transaction Processing,” IEEE Comput., Vol. 15, No. 3, February 1981, pp. 43–48.Google Scholar
- 21.Le Lann, G., “On Real-Time Distributed Computing,” invited paper, IFIP Congress, September 1983, North-Holland, Amsterdam, pp. 741–753.Google Scholar
- 23.Mahaney, S.R., and Schneider, F.B., “Inexact Agreement: Accuracy, Precision and Graceful Degradation,” Proc. 4th ACM Sigact-Sigops Symposium on Principles of Distributed Computing, August 1985.Google Scholar
- 24.Massey, J.L., “Collision-Resolution Algorithms and Random-Access Communications,” in Multi-User Communication Systems, G., Longo, ed., Springer-Verlag, Berlin, CISM No. 265, 1981, pp. 73–137.Google Scholar
- 26.Molle, M.L., “Unifications and Extensions of the Multiple Access Communications Problem,” UCLA Report No. CSD-810730, July 1981, p. 131.Google Scholar
- 28.Reed, D.P., “Implementing Atomic Actions on Decentralized Data,” Proc. 8th ACM Sigops Symposium, November 1979, pp. 66–74.Google Scholar
- 30.Rom, R., and Tobagi, F.A., “Message-Based Priority Functions in Local Multi- Access Communication Systems, ” Computer Networks, Vol. 5, July 1981, pp. 273–286.Google Scholar
- 32.Tobagi, F.A., “Carrier-Sense Multiple Access with Message-Based Priority Functions,” IEEE Trans. Commun., Vol. COM-30, January 1982, pp. 185–200.Google Scholar
- 33.Tobagi, F.A., and Rom, R., “Efficient Round-Robin and Priority Schemes for Unidirectional Broadcast Systems,” in Local Networks for Computer Communications, A. West and P. Janson, eds., North-Holland, Amsterdam, 1980, pp. 125–138.Google Scholar