Abstract
Real-time embedded systems are spreading to more and more new fields and their scope and complexity have grown dramatically in the last few years. Nowadays, real-time embedded computers or controllers can be found everywhere, both in very simple devices used in everyday life and in professional environments. Real-time embedded systems have to take into account robustness, safety and timeliness. The most-used schedulability analysis is the worst-case response time proposed by Joseph and Pandya (Comput J 29:390–395,1986). This test provides a bivaluated response (yes/no) indicating whether the processes will meet their corresponding deadlines or not. Nevertheless, sometimes the real-time designer might want to know, more exactly, the probability of the processes meeting their deadlines, in order to assess the risk of a failed scheduling depending on critical requirements of the processes. This paper presents RealNet, a neural network architecture that will generate schedules from timing requirements of a real-time system. The RealNet simulator will provide the designer, after iterating and averaging over some trials, an estimation of the probability that the system will not meet the deadlines. Moreover, the knowledge of the critical processes in these schedules will allow the designer to decide whether changes in the implementation are required.
Similar content being viewed by others
References
Stankovic JA (1997) Real time and embedded systems. In: 6th open workshop on high speed networks, Stuttgart
Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20:46–71
Burns A, Wellings A (1997) Real-time systems and programming languages. Addison-Wesley, Reading
Kim N, Ryu M, Hong S, Shin H (1999) Experimental assessment of the period calibration method: a case study. Real Time Syst J 17:41–64
Klein MH et al (1993) A practitioners handbook for real-time analysis. Kluwer, London
Joseph M, Pandya P (1986) Finding response time in a real-time sytem. Comput J 29:390–395
Cardeira C, Mammeri Z (1994) Neural networks for multiprocessor real-time scheduling. In: Proceedings of the 6th Euromicro workshop on real-time systems, pp 59–64
Willems TM, Rooda JE (1994) Neural networks for job-shop scheduling. Control Eng Pract 2(1):31–39
Fertsch M (2000) Neural scheduler. In: ICSC 2000 intelligent systems and applications. University of Wollongong, Australia
Gallone JM, Charpillet F (1996) Composing approximated algorithms based on Hopfield neural network for building a resource-bounded scheduler. In: Proceedings of ICTAI’96 (International conference on tools with artificial intelligence)
Ruey-Maw Chen, Yueh-Min Huang (2000) Competitive neural network to solve scheduling problems. Neurocomputing 37:177–196
Dominguez E, Muñoz J (2002) An efficient neural network algorithm for the p-median problem. In: Garijo FJ et al (eds) IBERAMIA 2002. Lecture notes in computer science, Lecture notes in artificial intelligence, vol 2527. Springer, Berlin Heidelberg New York, pp 460–469
Saksena M, Karvelas P (2000) Designing for schedulability. Integrating schedulability analysis with object-oriented design. In: Proceedings Euromicro conference on real-time systems
Alvarez JM, Díaz M, Llopis L, Pimentel E, Troya JM (2003) An object oriented methodology for embedded real time systems. Comput J 46(2):123–145
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Domínguez, E., Jerez, J., Llopis, L. et al. RealNet: a neural network architecture for real-time systems scheduling. Neural Comput & Applic 13, 281–287 (2004). https://doi.org/10.1007/s00521-004-0422-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-004-0422-3