A. Burns, Dept. of Comput. Sci., York Univ., UK
Abstract: 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.
Index Terms:
safety-critical software; real-time systems; distributed processing; transport protocols; resource allocation; processor scheduling; real-time distributed computing; real-time safety critical distributed systems; computational model; resource allocations scheme; fixed priority scheduling; flexibility; timing behaviour; end-to-end deadlines; priority based communication protocols
Citation:
A. Burns, N. Audsley, A. Wellings, "Real-time distributed computing," ftdcs, pp.0034, 5th IEEE Workshop on Future Trends of Distributed Computing Systems, 1995