Real-time distributed computing

This position paper concerns itself with real-time safety critical distributed systems. It presents a computational model that is appropriate for this type of application and architecture. It then defines a resource allocations scheme based upon fixed priority scheduling. Such a scheme has the advantage (over purely static schedules) of supporting greater levels of flexibility and non-determinism, whilst still providing static guarantees of necessary timing behaviour (i.e. end-to-end deadlines through the systems). Priority based communication protocols are investigated, with possible future techniques reviewed.

[1]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[2]  Alan Burns,et al.  Models of Replication for Safety Critical Hard Real Time Systems , 1996 .

[3]  Mark Klein,et al.  A practitioner's handbook for real-time analysis - guide to rate monotonic analysis for real-time systems , 1993, The Kluwer international series in engineering and computer science.

[4]  A. Burns,et al.  Deadline monotonic scheduling theory and application , 1993 .

[5]  George Bate.  Mascot 3: an informal introductory tutorial , 1986 .

[6]  David Beasley,et al.  An overview of genetic algorithms: Part 1 , 1993 .

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  Hussein Zedan,et al.  A Specification-Oriented Semantics for the Refinement of Real-Time Systems , 1994, Theor. Comput. Sci..

[9]  Andy J. Wellings,et al.  Analysing real-time communications: controller area network (CAN) , 1994, 1994 Proceedings Real-Time Systems Symposium.

[10]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[11]  John P. Lehoczky,et al.  An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[12]  Alan Burns,et al.  Effective Analysis for Engineering Real-Time Fixed Priority Schedulers , 1995, IEEE Trans. Software Eng..

[13]  Alan Burns,et al.  Calculating controller area network (can) message response times , 1995 .

[14]  Alan Burns,et al.  Integrating Best Effort and Fixed Priority Scheduling , 1994, RTSS 1994.

[15]  Theodore P. Baker,et al.  A stack-based resource allocation policy for realtime processes , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[16]  Hector Garcia-Molina,et al.  Subtask deadline assignment for complex distributed soft real-time tasks , 1994, 14th International Conference on Distributed Computing Systems.

[17]  Alan Burns,et al.  Scheduling slack time in fixed priority pre-emptive systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[18]  Hermann Kopetz,et al.  The real-time operating system of MARS , 1989, OPSR.

[19]  Lester Ingber,et al.  Simulated annealing: Practice versus theory , 1993 .

[20]  L. Sha,et al.  The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks , 1988, IRTAW '88.

[21]  David B. Beasley,et al.  An overview of genetic algorithms: Part 1 , 1993 .

[22]  Hermann Kopetz,et al.  Event-Triggered Versus Time-Triggered Real-Time Systems , 1991, Operating Systems of the 90s and Beyond.

[23]  Alan Burns,et al.  Fixed priority scheduling with deadlines prior to completion , 1994, Proceedings Sixth Euromicro Workshop on Real-Time Systems.

[24]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[25]  Alan Burns,et al.  Mechanisms for enhancing the flexibility and utility of hard real-time systems , 1994, 1994 Proceedings Real-Time Systems Symposium.

[26]  John P. Lehoczky,et al.  On-line scheduling of hard deadline aperiodic tasks in fixed-priority systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[27]  Alan Burns,et al.  Hrt-Hood: A Structured Design Method for Hard Real-Time ADA Systems , 1995 .

[28]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..