Scheduling and memory requirements analysis with AADL

This article describes an Ada set of packages which allows designers to perform resource requirements analysis of AADL specifications. This set of Ada packages is part of Cheddar, an Ada framework that we are developing at the University of Brest [22].The framework provides tools to check if AADL threads will meet their deadline at execution time. Some new AADL properties are proposed to model and analyze dependent AADL thread sets. It also provides some tools to perform memory requirements analysis on AADL specifications.

[1]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..

[2]  Jacek Blazewicz,et al.  Scheduling Dependent Tasks with Different Arrival Times to Meet Deadlines , 1976, Performance.

[3]  Laurent Nana,et al.  Cheddar: a flexible real time scheduling framework , 2004 .

[4]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[5]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[6]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[7]  David Finkel Brief review: Computer Networks & Systems: Queueing Theory and Performance Evaluation by Thomas Robertazzi (Springer-Verlag, 1990) , 1991, PERV.

[8]  Konstantin Avrachenkov,et al.  Priority queueing with finite buffer size and randomized push-out mechanism , 2003, SIGMETRICS '03.

[9]  Moshe Sidi,et al.  A queueing network with a single cyclically roving server , 1992, Queueing Syst. Theory Appl..

[10]  Laurent Pautet,et al.  Using the AADL to Describe Distributed Applications from Middleware to Software Components , 2005, Ada-Europe.

[11]  B. O. Gallmeister,et al.  POSIX.4 - programming for the real world , 1995 .

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

[13]  Maryline Chetto,et al.  Dynamic scheduling of real-time tasks under precedence constraints , 1990, Real-Time Systems.

[14]  John P. Lehoczky,et al.  Real-time queueing theory , 1996, 17th IEEE Real-Time Systems Symposium.

[15]  Ken Chen,et al.  An approximate analysis of waiting time in multi-class M/G/1/./EDF queues , 1996, SIGMETRICS '96.

[16]  Zoubir Mammeri,et al.  Scheduling in Real-Time Systems , 2002 .

[17]  Domenico Ferrari,et al.  Rate-Controlled Service Disciplines , 1994, J. High Speed Networks.

[18]  Yi Zhang,et al.  Non-blocking data sharing in multiprocessor real-time systems , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[19]  Ioannis Stavrakakis,et al.  A considerate priority queueing system with guaranteed policy fairness , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.