Abstract
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are interrelated by mutual exclusion and precedence constraints.
This paper presents an approach for pre-runtime scheduling of periodic tasks on multiple processors for a real-time system that must meet hard deadlines. The tasks can be related to each other by mutual exclusion and precedence forming an acyclic graph. The proposed scheduler is based on Genetic Algorithms, which relieves the user from knowing how to construct a solution. Consequently, the paper focuses on the problem encoding, i.e., the representation of the problem by genes and chromosomes, and the derivation of an appropriate fitness function. The main benefit of the approach is that it is scalable to any number of processors and can easily be extended to incorporate further requirements.
This work was in part supported by HP Labs, Palo Alto, California.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
L. Davis. Job-Shop Scheduling with Genetic Algorithms. In J. Grefenstette, editor, Proceedings of the 1st International Conference on Genetic Algorithms and Their Applications, pages 136–140. Lawrence Erlbaum, 1985.
M. DiNatale and J.A. Stankovic. Applicability of Simulated Annealing Methods to Real-Time Scheduling and Jitter Control. In Proc. 16th Real-Time Systems Symposium, pages 190–199. IEEE Computer Society Press, 1995.
M.R. Garey and D.S. Johnson. Computers and Intractability — A Guide to the Theory of NP-completeness. W.H. Freeman Co., San Francisco, CA, 1979.
J.H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975.
E.S.H. Hou, N. Ansari, and H. Ren. A Genetic Algorithm for Multiprocessor Scheduling. IEEE Transactions on Parallel and Distributed Systems, 5(2):113–120, February 1994.
H. Kopetz. Real-Time Systems, Design Principles for Distributed Embedded Applications. Kluwer Academic Publishers, Norwell, Massachusetts, 1997.
C.L. Liu and J.W. Layland. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. Journal of the ACM, 20(1):46–61, January 1973.
A.K. Mok. Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, May 1983.
R. Nossal. An Interface-Focused Methodology for the Development of Time-Triggered Real-Time Systems Considering Organizational Constraints. PhD thesis, Technisch-Naturwissenschaftliche Fakultät, Technische Universität Wien, Vienna, Austria, October 1997.
R. Nossal. Static Message Scheduling for a TDMA-Based Real-Time Communication System. Submitted for Publication at the 6th International Workshop on Parallel and Distributed Real-Time Systems, Orlando, Florida, March 1998.
R. Nossal and T.M. Galla. Solving NP-Complete Problems in Real-Time System Design by Multichromosome Genetic Algorithms. In Proceedings of the SIGPLAN 1997 Workshop on Languages, Compilers, and Tools for Real-Time Systems, pages 68–76. ACM SIGPLAN, June 1997.
K. Ramamritham. Allocation and Scheduling of Precedence-Related Periodic Tasks. IEEE Trans. on Parallel and Distributed Systems, 6(4):412–420, April 1995.
K. Ramamritham and J.A. Stankovic. Scheduling Algorithms and Operating Systems Support for Real-Time Systems. Proceedings of the IEEE, 82(1):55–67, January 1994.
D. Smith. Bin Packing with Adaptive Search. In J. Grefenstette, editor, Proceedings of the 1st International Conference on Genetic Algorithms and Their Applications, pages 202–207. Lawrence Erlbaum, 1985.
M. Srinivas and L.M. Patnaik. Genetic Algorithms: A Survey. IEEE Computer, pages 17–26, June 1994.
J. Verhoosel. Deterministic Scheduling of Distributed Hard Real-Time Systems using Windows. In Proceedings 1st IEEE Workshop on Parallel and Distributed Real-Time Systems, pages 252–256, April 1993.
J. Xu and D.L. Parnas. On Satisfying Timing Constraints in Hard-Real-Time Systems. IEEE Transactions on Software Engineering, 19(1):70–84, January 1993. *** DIRECT SUPPORT *** A0008D07 00010
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nossal, R. (1998). An evolutionary approach to multiprocessor scheduling of dependent tasks. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_698
Download citation
DOI: https://doi.org/10.1007/3-540-64359-1_698
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64359-3
Online ISBN: 978-3-540-69756-5
eBook Packages: Springer Book Archive