MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Improved response time Analysis calculation (1998) [2 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Mikael Sjodin, Hans Hansson
IEEE Real-Time Systems Symposium
http://archi.snu.ac.kr/kimjy/Export/archiseminar/167.ps.gz
Add To MetaCart

Abstract:

Schedulability analysis of fixed priority preemptive scheduled systems can be performed by calculating the worst-case response-time of the involved processes. The system is deemed schedulable if the calculated response-time for each process is less than the corresponding deadline. It is desirable that the employed ResponseTime Analysis (RTA) can be efficiently performed. This is particularly important in dynamic real-time systems when a fast response is needed to decide whether a new job can be accommodated, or when the RTA is extensively applied, e.g., when used to guide the heuristics in a higher level optimiser. This paper presents a set of methods to improve the efficiency of RTA calculations. The methods are proved correct, in the sense that they give the same results as traditional (non-improved) RTA. We also present an evaluation of the improvements, by applying them to a particularly time-consuming traffic model used in RTA for ATM communication networks. Our evaluation shows that the proposed methods dramatically decrease the execution time of RTA.

Citations

2168 Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment – Liu, Layland - 1973
1409 A generalized processor sharing approach to flow control in integrated services network – Parekh - 1992
99 Fixed priority pre-emptive scheduling: An historical perspective – Audsley, Burns, et al. - 1995
67 Analysing Real-Time Communications: Controller Area Network (CAN – Tindell, Hansson, et al. - 1994
59 Optimal Priority Assignment and Feasibility of Static Priority Tasks with Arbitrary Start Times – Audsley - 1991
28 Fixed Priority Scheduling of Hard Real-Time Systems – Tindell - 1994
14 Fixed priority scheduling of hard real-time multi-media disk traffic – Tindell, Burns - 1994
13 Response-Time Guarantees in ATM Networks – Ermedahl, Hansson, et al. - 1997
13 Response-Time Analysis for ATM Networks – Sjodin - 1997
9 Gigabit Networking. Computing Series – Partridge - 1994
8 Guaranteeing Real-Time Traffic Through an ATM Network – Hansson, Sjodin, et al. - 1997
6 An Extendible Approach for Analysing Fixed-Priority Hard Real-Time Tasks – Tindell, Burns, et al. - 1994
3 Finding response times in a real-time system”, The computer journal (British computing society – Joseph, Pandia - 1986