![](bga.png)
by sets of periodic/aperiodic tasks sharing resources
and with precedence constraints. It is assumed that
the system under consideration can be reconfigured
repeatedly. In order to offer low-power consumption
before and after the application of any reconfiguration
scenario, a DWCS architecture is defined. An intelli-
gent software control agent is proposed accordingly
to evaluate the power consumption and reconfigure
the system. First of all the agent manages the prece-
dence constraints. Then, it creates the different virtual
processors. After that, it modifies the parameters of
periodic/aperiodic tasks. And finally it evaluates the
power consumption.
To our best knowledge, no work dealing with a
middleware is found to dynamically reconfigure RT-
Linux.
REFERENCES
Baker, T. (1991). Stack-based scheduling of realtime pro-
cesses. Journal of Real-Time Systems.
Burns, A. and Wellings, A. (2001). Scheduling algorithms
for multiprogramming in a hard real time environ-
ment. In Addison Wesley Longmain.
C. Angelov, K. S. and Marian, N. (2005). Design models
for reusable and reconfigurable state machines. Proc.
of Embedded Ubiquitous Comput.
D. Faggioli, F. Checconi, M. T. and Scordino, C. An edf
scheduling class for the linux kernel. Germany. Proc.
of the 11th Real-Time Linux Workshop.
F. Singhoff, J. Legrand, L. N. and Marce, L. (2004). Ched-
dar: A flexible real time scheduling framework. As-
soc. Comput. Mach.
FSM Labs, I. (2001). Getting-started-with-rtlinux.
George, L. and Courbin, P. Reconfiguration of unipro-
cessor sporadic real-time systems: the sensitivity ap-
proach. In chapter in IGI-Global Knowledge on Re-
configurable Embedded.
George, L. and Courbin, P. (2011). Reconfiguration of
uniprocessor sporadic real-time systems: the sensitiv-
ity approach. IGI-Global Knowledge on Reconfig-
urable Embedded Control Systems: Applications for
Flexibility and Agility.
H. Chetto, M. C. (1989). Some Results of the Earliest Dead-
line Scheduling Algorithm. IEEE Tr. on Software En-
gineering.
Hamdaoui, M. and Ramanathan, P. (1995). A dynamic pri-
ority assignment technique for streams with (m,k)firm
deadlines. IEEE Transactions on Computers.
I.Khemaissia (2012). master’sthesis: “Low-power recon-
figurations of real-time embedded systems. Tunisia.
Ishihara, T. (2010). A multi-performance processor for re-
ducing the energy consumption of real-time embed-
ded systems. IEICE Trans. on Fundamentals of Elec-
tronics, Communications and Computer Sciences.
K. Thramboulidis, G. D. and Frantzis, A. (2004). Towards
an implementation model for fb-based reconfigurable
distributed control applications. Vienna. Proc. IEEE
7th Int. Symp. Object-Oriented Real-Time Dist. Com-
put.
Khalgui, M. and Hanisch, H.-M. (2011). Reconfigura-
tion protocol for multi-agent control software archi-
tectures. IEEE Trans. Syst. Man Cybern. Part C Appl.
Rev.
L. George, N. R. and Spuri, M. (1996). Preemptive
and non-preemptive scheduling real-time uniproces-
sor scheduling. INRIA Research Report.
Liu, C. L. and Layland, J. W. Scheduling algorithms for
multiprogramming in a hard real time environment. In
J. Assoc. Comput. Mach.
M. Khalgui, O. Mosbahi, Z. W. L. and Hanisch, H.-M.
(2011). Reconfiguration of distributed embedded-
control systems. IEEE/ASME Trans. Mechatronics.
Niu, L. W. (2011). Energy efficient scheduling for real-time
embedded systems with qos guarantee. Real-Time
Syst.
P. Balbastre, I. R. and Crespo, A. (2002). Schedulability
analysis of window-constrained execution time tasks
for real-time control. Proc. 14th Euromicro Conf.
Real-Time Syst.
Quan, D. and Hu, X. S. (2003). Minimal energy fixed-
priority scheduling for variable voltage processors.
IEEE Trans. Comput.-Aid. Des. Integ. Circu. Syst.
Ramanathan, P. (1999). Overload management in real-time
control applications using (m,k)-firm guarantee. IEEE
Trans:arallel and Distributed Systems.
S. Baruah, R. H. and Rosier, L. (1990). Algorithms and
complexity concerning the preemptive scheduling of
periodic real-time tasks on one processor. Real-Time
Syst.
Shin, Y. and Choi, K. (1999). Power conscious fixed priority
scheduling for hard real-time systems. New Orleans.
Proc. IEEE Des. Autom. Conf.
T. Yokoyama, G. Zeng, H. T. and Takada, H. (2010). Static
task scheduling algorithms based on greedy heuristics
for battery-powered dvs systems. IEICE Trans. In-
form. Syst.
T.P.Baker (1990). A stack-based resource allocation policy
for realtime processes. In Real-Time Systems Sympo-
sium.
West, R. and Poellabauer, C. (2000). Analysis of a window-
constrained scheduler for real-time and best-effort
packet streams. Proc. 21st IEEE Real-Time Syst.
Symp.
West, R. and Schwan, K. (1999). Dynamic window-
constrained scheduling for multimedia applications.
IEEE, 6th Intern. Conf. Mult. Comp. and Systems.
X. Wang, M. K. and Li, Z. W. (2011). Dynamic low power
reconfigurations of real-time embedded systems. In
in: Proc. 1st Pervas. Embedded Comput. Commu.
Syst, Portugal.
NewReconfigurableMiddlewareforFeasibleAdaptiveRT-Linux
167