Deadline assignment for component-based analysis of real-time transactions

Real-time transactions are often used to model distributed applications in many fields such as multimedia, automotive, etc. Transactions are sequences of real-time tasks activated periodically. All tasks of a real-time transaction must complete before an end-to-end deadline set by the designer. The holistic analysis of a set of transactions does not provide any degree of isolation among the transactions, preventing a true compositional analysis of real-time transactions. In this paper, we propose to treat each transaction as a separate component. We investigate the deadline assignment that minimizes the resource requirement of a single transaction by presenting both theoretical and experimental results.

[1]  Petru Eles,et al.  Holistic scheduling and analysis of mixed time/event-triggered distributed embedded systems , 2002, Proceedings of the Tenth International Symposium on Hardware/Software Codesign. CODES 2002 (IEEE Cat. No.02TH8627).

[2]  Hector Garcia-Molina,et al.  Deadline Assignment in a Distributed Soft Real-Time System , 1997, IEEE Trans. Parallel Distributed Syst..

[3]  Giuseppe Lipari,et al.  Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling , 2007, J. Comput. Syst. Sci..

[4]  Jukka Mäki-Turja,et al.  Efficient implementation of tight response-times for tasks with offsets , 2008, Real-Time Systems.

[5]  Giorgio C. Buttazzo,et al.  Measuring the Performance of Schedulability Tests , 2005, Real-Time Systems.

[6]  Alan Burns,et al.  An extendible approach for analyzing fixed priority hard real-time tasks , 1994, Real-Time Systems.

[7]  Aloysius K. Mok,et al.  A model of hierarchical real-time virtual resources , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[8]  Rocquencourt,et al.  Analysis of Deadline Scheduled Real-Time Systems , 1996 .

[9]  Kang G. Shin,et al.  Deadline assignment in distributed hard real-time systems with relaxed locality constraints , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.

[10]  Giuseppe Lipari,et al.  A hierarchical scheduling model for component-based real-time systems , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[11]  John A. Stankovic,et al.  Dynamic end-to-end guarantees in distributed real time systems , 1994, 1994 Proceedings Real-Time Systems Symposium.

[12]  Michael González Harbour,et al.  Offset-based response time analysis of distributed systems scheduled under EDF , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[13]  Insup Lee,et al.  Periodic resource model for compositional real-time guarantees , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[14]  Ola Redell,et al.  Exact best-case response time analysis of fixed priority scheduled tasks , 2002, Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002.

[15]  Emmanuel Grolleau,et al.  Feasibility Analysis of Non-Concrete Real-Time Transactions With EDF Assignment priority , 2008 .

[16]  Louis E. Rosier,et al.  On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor , 1990, MFCS.

[17]  W. Tindell.  AN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS , 1994 .

[18]  Michael González Harbour,et al.  Schedulability analysis for tasks with static and dynamic offsets , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[19]  Liliana Cucu-Grosjean,et al.  Exact best-case response time analysis of real-time tasks under fixed-priority pre-emptive scheduling for arbitrary deadlines , 2009, ECRTS 2009.

[20]  Giuseppe Lipari,et al.  A methodology for designing hierarchical scheduling systems , 2005, J. Embed. Comput..