Real-Time Computing: A New Discipline of Computer Science and Engineering

Proceedings of the IEEE

Volumn 82, Issue 1, 1994, Pages 6-24

  Shin, Kang G ^a   Ramanathan, Parameswaran ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER AIDED ENGINEERING; COMPUTER OPERATING PROCEDURES; COMPUTER SCIENCE; COMPUTER SYSTEM RECOVERY; FAULT TOLERANT COMPUTER SYSTEMS; RELIABILITY; SCHEDULING; SYSTEMS ANALYSIS;

APERIODIC TASKS; PERIODIC TASKS; REAL TIME COMPUTING;

REAL TIME SYSTEMS;

EID: 0028312799     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.259423     Document Type: Article

References (112)

1. G. Agrawal, B. Chen, and W. Zhao, “Optimal synchronous capacity allocation for hard real time communication with the timed-token protocol,” in Proc. Real Time Systems Symp., Dec. 1992, pp. 198–207.
2. G. Agrawal, B. Chen, W. Zhao, and S. Davari, “Guaranteeing synchronous message deadlines with the timed token protocol,” in Proc. Distributed Computing Systems, June 1992, pp. 468–475.
3. P. E. Agre and D. Chapman, “Pengi: An implementation of a theory of activity,” in Proc. Nat. Conf. on Artificial Intelligence. Morgan Kaufmann: 1987, pp. 268–272.
4. D. P. Anderson, “The DASH project: An overview,” Tech. Rep. UCB/CSD, Dept. of Elec. Eng. Comput. Sci., Univ. of California, Berkeley, Feb. 1988.
5. “A software architecture for network communication,” in Proc. Distributed Computing Systems, June 1988, pp. 376–383.
6. R. C. Arkin, “Integrating behavioral, perceptual, and world knowledge in reactive navigation,” in Robotics and Autonomous Systems 6, 1990, pp. 105–122.
7. J. E. Arnold, “Experiences with the subsumption architecture,” in Conf on Artificial Intelligence Applications, 1989, pp. 93–100.
8. A. Belleisle, “Stability of systems with nonlinear feedback through randomly time-varying delays,” IEEE Trans. Automat. Contr., vol. AC-20, no. 1, pp. 67–75, Feb. 1975.
9. M. Boddy and T. Dean, “Solving time-dependent planning problems,” in Proc. Int. Joint Conf on Artificial Intelligence, Aug. 1989, pp. 979–984.
10. S. H. Bokhari, “A shortest tree algorithm for optimal assignments across space and time in a distributed processor system,” IEEE Trans. Software Eng., vol. 7, no. 6, pp. 583-589, 1981.
11. R. A. Brooks, “A robust layered control system for a mobile robot,” IEEE J. Robotics Automat., vol. RA-2, no. 1, pp. 14–22, Mar. 1986.
12. R. L. Burden and J. D. Faires, Numerical Analysis. PWS-KENT KENT Pub., 1989.
13. H.L. Chen and N.F. Tzeng, “Fault-tolerant resource placement in hypercube computers,” in Proc. Int. Conf on Parallel Processing, Aug. 1991, pp. 517–524.
14. M.S. Chen and K. G. Shin, “Depth-first search approach for fault-tolerant routing in hypercube multicomputers,” IEEE Trans. Parallel Distributed Syst., vol. 1, no. 2, pp. 152–159, Apr. 1990.
15. M.S. Chen, K. G. Shin, and D. D. Kandlur, “Addressing, routing and broadcasting in hexagonal mesh multiprocessors,” IEEE Trans. Comput., vol. 39, no. 1, pp. 1 0–18, Jan. 1990.
16. S. Chodrow, F. Jahanian, and M. Donner, “Run-time monitoring of real time systems,” in Proc. Real Time Systems Symp., Dec. 1991, pp. 74–83.
17. J.Y. Chung, J. W. Liu, and K.J. Lin, “Scheduling periodic jobs that allow imprecise results,” IEEE Trans. Comput., vol. 39, no. 9, pp. 1156–1174, Sept. 1990.
18. F. Cristian, “Probabilistic clock synchronization,” Tech. Rep. RJ 6432 (62550), IBM Almaden Research Center, Sept. 1988.
19. A. Damm, J. Reisinger, W. Schwabl, and H. Kopetz, ‘'The real time time operating system of MARS,” ACM Operating Syst. Rev., vol. 23, no. 3, pp. 141–157, July 1989.
20. D. Dolev and J. Halpern, “On the possibility and impossibility of achieving clock synchronization,” in Proc. Symp. on Theory of Computing, Apr. 1984, pp. 504–511.
21. E. H. Durfee, “A cooperative approach to planning for real time time control,” in Proc. Workshop on Innovative Approaches to Planning, Scheduling and Control, Nov. 1990, pp. 277–283.
22. D. L. Eager, E. D. Lazowska, and J. Zahorjan, “Adaptive load sharing in homogeneous distributed systems,” IEEE Trans. Software Eng., vol. SE-12, no. 5, pp. 662–675, May 1986.
23. D. Ferrari and D. C. Verma, “A scheme for real time channel establishment in wide-area networks,” IEEE J. Selected Areas Common., vol. 8, no. 3, pp. 368–379, Apr. 1990.
24. H. Garcia-Molina, B. Kao, and D. Barbara, “Aggressive trans-missions over redundant paths,” in Proc. Distributed Computing Systems, 1991, pp. 198–207.
25. GDX, sales literature of Firmware Associates, Inc., West Chester, PA, 1992.
26. A. Gosiewski and A. Olbrot, “The effect of feedback delays on the performance of multivariable linear control systems,” IEEE Trans. Automat. Contr., vol. AC-25, no. 4, pp. 729–734, Aug. 1980.
27. M. H. Graham, “Issues in real time data management,” J. Real Time Time Syst., vol. 4, no. 3, pp. 185–202, Sept. 1992.
28. D. Haban and K. G. Shin, “Application of real time monitoring for scheduling tasks with random execution times,” IEEE Trans. Software Eng., vol. 16, no. 12, pp. 1374–1389, Dec. 1990.
29. J. Y. Halpern, B. Simons, R. Strong, and D. Dolev, “Fault-tolerant tolerant clock synchronization,” in Proc. Principles of Distributed Computing, 1984, pp. 89–102.
30. M. Hamdaoui and P. Ramanathan, “Selection of timed token protocol parameters to guarantee message deadlines,” Tech. Rep. ECE-92-10, Univ. of Wisconsin—Madison, Nov. 1992.
31. “A dynamic multiple copy approach for message passing in virtual cut-through environment,” in Proc. Int. Parallel Processing Symp., Apr. 1993, pp. 757–761.
32. S. Hanks and R. J. Firby, “Issues and architectures for planning and execution,” in Proc. Workshop on Innovative Approaches to Planning, Scheduling and Control, Nov. 1990, pp. 59–70.
33. J. R. Haritsa, M. J. Carey, and M. Livny, “Data access scheduling in firm real time database systems,” J. Real Time Syst., vol. 4, no. 3, pp. 203–241, Sept. 1992.
34. K. Hirai and Y. Satoh, “Stability of a system with variable time delay,” IEEE Trans. Automat. Contr., vol. AC-25, no. 3, pp. 552–554, June 1980.
35. E. J. Horvitz, “Reasoning about beliefs and actions under computational resource constraints,” in Proc. Workshop on Uncertainty in Al, 1987.
36. C.J. Hou and K. G. Shin, “Load sharing with consideration of future task arrivals in heterogeneous distributed real time systems,” in Proc. Real Time Systems Symp., Dec. 1991, pp. 94–103.
37. “Incorporation of optimal timeouts into distributed real time time load sharing,” in Proc. Hawaii Int. Cool. on System Sciences, Jan. 1993, pp. 603–612
38. F. Jahanian and A. Goyal, “A formalism for monitoring real time time constraints at run-time,” in Proc. Fault-Tolerant Computing Symp. (FTCS-20), June 1990, pp. 148–155.
39. D. D. Kandlur and K. G. Shin, “Traffic routing for multicomputer puter networks with virtual cut-through,” IEEE Trans. Comput., vol. 41, no. 10, pp. 1257–1270, Oct. 1992.
40. D. D. Kandlur, K. G. Shin, and D. Ferrari, “real time communication in multi-hop networks,” in Proc. Distributed Computing Systems, May 1991, pp. 300–307.
41. J. L. W. Kessels, “Two designs of a fault-tolerant clocking system,” IEEE Trans. Comput., vol. C-33, no. 10, pp. 912–919, Oct. 1984.
42. R. M. Kieckhafer, C. J. Walter, A. M. Finn, and P. M. Thambidurai, “The MAFT architecture for distributed fault tolerance,” IEEE Trans. Comput., vol. 37, no. 4, pp. 398–405, Apr. 1988.
43. R. E. Korf, “real time search for dynamic planning,” in Proc. AAA’ Spring Symp. on Planning in Uncertain, Unpredictable, or Changing Environments, 1990.
44. C. M. Krishna and K. G. Shin, “On scheduling tasks with a quick recovery from failure,” IEEE Trans. Comput., vol. C-35, no. 5, pp. 448–455, May 1986.
45. C. M. Krishna, K. G. Shin, and R. W. Butler, “Synchronization and fault-masking in redundant real time systems,” in Dig. Papers, FTCS-14, June 1984, pp. 152–157.
46. Ensuring fault tolerance of phase-locked clocks,” IEEE Trans. Comput., vol. C-34, no. 8, pp. 752–756, Aug. 1985.
47. J. F. Kurose, M. Schwartz, and Y. Yemini, “Controlling window protocols for time-constrained communication in multiple access networks,” IEEE Trans. Commun., vol. 36, no. 1, pp. 41–49, Jan. 1988.
48. T. J. Laffey, P. A. Cox, J. L. Schmidt, S. M. Kao, and J. Y. Read, “real time knowledge-based systems,” Al Mag., vol. 9, no. 1, pp. 27–45, 1988.
49. L. Lamport and P. M. Me lliar-Smith, “Synchronizing clocks in the presence of faults,” J. Assoc. Comput. Mach., vol. 32, no. 1, pp. 52–78, Jan. 1985.
50. V. R. Lesser, J. Pavlin, and E. Durfee, “Approximate processing in real time problem solving,” AI Mag., vol. 9, no. 1, pp. 49–61, 1988.
51. C. L. Liu and J. W. Layland, “Scheduling algorithms for multiprogramming in a hard real time environment,” J. Assoc. Comput. Mach., vol. 20, no. 1, pp. 46–61, Jan. 1973.
52. J. Liu, K.J. Lin, W.K. Shih, A. Yu, A.Y. Chung, and W. Zhao, “Algorithms for scheduling imprecise computations,” Computer, vol. 24, no. 5, pp. 58–69, May 1991.
53. V. B. Lortz and K. G. Shin, “MDARTS: A multiprocessor database architecture for real time systems,” Tech. Rep. CSE-TR-155-93, TR-155-93, CSE Div., Dep. Elec. Eng. Comput. Sci., Univ. of Michigan, Ann Arbor, MI, Mar. 1993.
54. J. Lundelius-Welch and N. Lynch, “A new fault-tolerant algorithm for clock synchronization,” Informat. and Computat., vol. 77, no. 1, pp. 1–36, 1988.
55. D. P. Miller and E. Gat, “Exploiting known topologies to navigate with low-computation sensing,” in Proc. SPIE Sensor Fusion Conf., Nov. 1990.
56. H. Mitra and P. Ramanathan, “A genetic approach for scheduling non-preemptive tasks with precedence and deadline constraints,” in Proc. Hawaii Int. Conf on System Sciences, Jan. 1993.
57. A. K. Mok and M. L. Dertouzos, “Multiprocessor scheduling in a hard real time environment,” in Proc. Texax Conf. on Computing Systems, Nov. 1978.
58. J. J. Molini, S. K. Maimon, and P. H. Watson, “real time system scenarios,” in Proc. Real Time Systems Symp., Dec. 1990, pp. 214–225.
59. M. L. Molle and L. Kleinrock, “Virtual time CSMA: Why two clocks are better than one,” IEEE Trans. Commun., vol. COM-33, no. 9, pp. 919–933, Sept. 1985.
60. D. J. Musliner, E. H. Durfee, and K. G. Shin, “CIRCA: A cooperative intelligent real time control architecture,” IEEE Trans. Systems, Man, Cybern., vol. 23, no. 6, Nov./Dec. 1993 (in press).
61. D. J. Musliner, E. H. Durfee, and K. G. Shin, “CIRCA: A cooperative intelligent real time control architecture,” IEEE Trans. Systems, Man, Cybern., vol. 23, no. 6, Nov./Dec. 1993 (in press).
62. A. Olson and K. G. Shin, “Message routing in HARTS with faulty components,” in Proc. Fault-Tolerant Computing Symp., June 1989, pp. 331–338.
63. “Probabilistic clock synchronization in large distributed systems,” in Proc. II th Int. Conf. on Distributed Computer Systems, May 1991, pp. 290–297.
64. C. J. Paul, A. Acharya, B. Black, and J. K. Strosnider, “Reducing problem-solving variance to improve predictability,” Commun. ACM, vol. 34, no. 8, pp. 81-93; Aug. 1991.
65. D. Peng and K. G. Shin, “Static allocation of periodic tasks with precedence constraints in distributed real time systems,” in Proc. 9th Int. Conf. on Distributed Computer Systems, June 1989, pp. 190–198.
66. K. Ramamritham, “Allocation and scheduling of complex periodic tasks,” in Proc. Int. Conf on Distributed Computing Systems, May 1990, pp. 108–115.
67. K. Ramamritham and J. A. Stankovic, “Distributed scheduling of tasks with deadlines and resource requirements,” IEEE Trans. Comput., vol. 38, no. 8, pp. 1110–1123, Aug.1989.
68. K. Ramamritham, “real time databases” (Invited Paper),/nt. J. Distributed and Parallel Databases, to be published, 1992.
69. P. Ramanathan and S. Chalasani, “Resource placement in k-ary n-cubes,” in Proc. Int. Parallel Processing Symp., pp. II-133-11-140, 140, Aug. 1992.
70. P. Ramanathan, D. D. Kandlur, and K. G. Shin, “Hardware assisted software clock synchronization for homogeneous distributed systems,” IEEE Trans. Comput., vol. 39, no. 4, pp. 514–524, Apr. 1990.
71. P. Ramanathan and G. M. Rupnick, “Deadline constrained message scheduling in point-to-point interconnection,” in Proc. Systems Design Synthesis Technology Workshop(Silver Spring, MD, Naval Surface Warfare Center, Sept. 1991), pp. 183–192.
72. P. Ramanathan and K. G. Shin, “A multiple copy approach for delivering messages under deadline constraints,” in Proc. Fault-Tolerant Computing Symp., June 1991, pp. 300–307.
73. “Delivery of time-critical messages using a multiple copy approach,” ACM Trans. Comput. Syst., vol. 10, no. 2, pp. 144–166, May 1992.
74. P. Ramanathan, K. G. Shin, and R. W. Butler, “Fault-tolerant clock synchronization in distributed systems,” IEEE Comput., vol. 23, no. 10, pp. 33–42, Oct. 1990.
75. RTA Introduction & Overview, Real Time Computer software GmbH, 1992.
76. Z. V. Rekasius, “Stability of digital control with computer interruption,” IEEE Trans. Automat. Contr., vol. AC-31, no. 4, pp. 356–359, Apr. 1986.
77. F. E. Ross, “FDDI-A tutorial,” IEEE Commun. Mag., vol. 24, pp. 46–61, May 1986.
78. L. Sha, R. Rajkumar, and J. P. Lehoczky, “Concurrency control for distributed real time databases,” SIGMOD Rec., vol. 17, no. 1, pp. 82–98, Mar. 1988.
79. K. G. Shin, “HARTS: A distributed real time architecture,” IEEE Comput., vol. 24, no. 5, pp. 25–35, May 1991.
80. K. G. Shin and Y.-C. Chang, “Load sharing in distributed real time systems with state-change broadcasts,” IEEE Trans. Comput., vol. 38, no. 8, pp. 1124–1142, Aug. 1989.
81. K. G. Shin and X. Cui, “Effects of computing time delay on real time control systems,” in Proc. 1988 American Control Conf, 1988, pp. 1071–1076.
82. K. G. Shin and G. L. Dykema, “Distributed WO architecture for {HARTS}, ” in Proc. 17th Int. Symp. on Computer Architectures, June 1990, pp. 332–342.
83. K. G. Shin and H. Kim, “A time redundancy approach to tmr failures using fault-state likelihoods,” IEEE Trans. Comput. (in press).
84. “Derivation and application of hard deadlines for real time time control systems,” IEEE Trans. System, Man, Cybern., vol. 22, no. 6, pp. 1403–1413, Nov./Dec. 1992.
85. K. G. Shin, C. M. Krishna, and Y.-H. Lee, “A unified method for evaliating real time computer controller and its application,” IEEE Trans. Automat. Contr., vol. AC-30, no. 4, pp. 357–366, Apr. 1985.
86. K. G. Shin and P. Ramanathan, “Clock synchronization of a large multiprocessor system in the presence of malicious faults,” IEEE Trans. Coniput., vol. C-36, no. 1, pp. 2–12, Jan. 1987.
87. “Transmission delays in hardware clock synchronization,” IEEE Trans. Comput., vol. 37, no. 11, pp. 1465–1467, Nov. 1988.
88. R. Simmons, “An architecture for coordinating planning, sensing, and action,” in Proc. Workshop on Innovative Approaches to Planning, Scheduling and Control, Nov. 1990, pp. 292–297.
89. H. A. Simon, Models of Bounded Rationality. Boston, MA: M.I.T. Press, 1982.
90. M. Singhal, “Issues and approaches to design of real time database systems,” SIGMOD Rec., vol. 17, no. 1, pp. 19–33, Mar. 1988.
91. T. B. Smith, “Fault-tolerant clocking system,” in Proc. Fault-Tolerant Tolerant Computing Symp., 1981, pp. 262–264.
92. T. B. Smith and J. H. Lala, “Development and evaluation of a fault-tolerant multiprocessor (FTMP) computer: FTMP principles of operation,” Contractor Rep.166071, NASA, Langley Res. Ctr., May 1983.
93. T. K. Srikanth and S. Toueg, “Optimal clock synchronization,” J. Assoc. Comput. Mach., vol. 34, no. 3, pp. 626–645, July 1987.
94. J. Stankovic, “SpringNet: A scalable architecture for high performance, predictable, distributed, real time computing,” Tech. Rep.91-74, Univ. of Massachusetts, Oct. 1991.
95. J. A. Stankovic, “Misconceptions about real time computing: A serious problem for next generation systems,” IEEE Comput., vol. 21, no. 10, pp. 10–19, Oct. 1988.
96. J. A. Stankovic and K. Ramamritham, “The design of Spring kernel,” in Proc. Real Time Systems Symp., Dec. 1987, pp. 146–157.
97. J. A. Stankovic, “Misconceptions about real time computing: A serious problem for next generation systems,” IEEE Comput., vol. 21, no. 10, pp. 10–19, Oct. 1988.
98. J. K. Strosnider, T. Marchok, and J. P. Lehoczky, “ Advanced, real time scheduling using the IEEE 802.5 token ring,” in Proc. Real Time Systems Symp., vol. 21, no. 10, pp. 10–19, Oct. 1988.
99. A. L. Tannenbaum, Computer Networks Englewood Cliffs, NJ: Prentice-Hall, 1981.
100. K. W. Tindell, A. Burns, and A. J. Wellings, “Allocating hard real time tasks: An NP-hard problem made easy,” Real Time Syst., vol. 4, no. 2, pp. 145–165, June 1992.
101. H. Tokuda, M. Koreta, and C. Mercer, “A real time monitor for a distributed real time o.s.,” ACM SIGPlan Notices, vol. 24, no. 1, pp. 68–77, Jan. 1989.
102. J. P. Tsai, K.-Y. Fang, and H.-Y. Chen, “A noninvasive architecture to monitor real time distributed systems,” Comput., vol. 23, no. 3, pp. 11–23, Mar. 1990.
103. N. Vasanthavada and P. N. Marinos, “Synchronization of fault-tolerant tolerant clocks in the presence of malicious failures,” IEEE Trans. Comput., vol. 37, no. 4, pp. 440 118, Apr. 1988.
104. J. P. C. Verhoosel, E. J. Luit, and D. K. Hammer, “A static scheduling algorithm for distributed hard real time systems,” Real Time Syst., vol. 3, no. 3, pp. 227–246, Sept. 1991.
105. W. Zhao and K. Ramamritham, “Virtual time {CSMA) protocols for hard real time communications,” IEEE Trans. Software Eng., vol. SE-13, no. 8, pp. 938–952, Aug. 1987.
106. W. Zhao, K. Ramamritham, and J. A. Stankovic, “Preemptive scheduling under time and resource constraints,” IEEE Trans. Comput., vol. C-36, no. 8, pp. 949–960, Aug. 1987.
107. “Scheduling tasks with resource requirements in hard real time systems,” IEEE Trans. Software Eng., vol. SE-13, no. 5, pp. 564–577, May 1987.
108. W. Zhao, J. A. Stankovic, and K. Ramarnritham, “A window protocol for transmission of time constrained messages,” IEEE Trans. Comput., vol. 39, no. 9, pp. 1186–1203, Sept. 1990.
109. Q. Zheng and K. G. Shin, “Establishment of isolated failure immune real time channels in harts,” IEEE Trans. Parallel Distrib. Syst. (in press).
110. “On the ability of establishing real time channels in point-to-point packet-switched networks,” IEEE Trans. Commun. (in press), 1993.
111. “On the ability of establishing real time channels in point-to-point packet-switched networks,” IEEE Trans. Commun. (in press), 1993.
112. “Synchronous bandwidth allocation in {FDDI} networks,” In proc ACM multimedia. pp 31-38, 1993.