LA-PR: Priority Task Graph Scheduling Basedon Learning Automata for Real Time Systems
DOI:
https://doi.org/10.18486/ijcsnt/1.1.004Keywords:
Multiprocessor Scheduling, Real Time Systems, Task Graph, Learning AutomataAbstract
One of the main issue and main challenge in real time systems is achieving to acceptable results in acceptable time. a job in multiprocessor real time systems divide in the set of the tasks with the relation between them in order that one task can be execute only when it's parents executed. by difficulty in scheduling the task graph and it's complexity, many effort accomplish for finding the best optimized solution. In this paper, we tried to have the balance between the processor and also reduce relation between the processor and importance of them we tried to improved the speed of getting the response. In most of the activity and experiment, the run time of the scheduling algorithm ignored. finally, the result of maintaining this solution show that we can have the appropriate schedule in acceptable time. also in this paper, at the end, we compared the proposal algorithm with the other famous scheduling algorithm.
References
Georgios L. Stavrinides, Helen D. Karatza, ScienceDirect, “Scheduling Multiple Task Graphs with End-to-End Deadlines in Distributed Real-Time Systems Utilizing Imprecise Computations”, 2010. DOI: https://doi.org/10.1016/j.jss.2009.12.025
Izadkhah H., Lotfi Sh., Isazadeh A., “Task Graph Scheduling in Heterogeneous Systems”, 16th International Conference of Iran, 2010.
K. S. Narendra and M. A. L. Thathachar, “Learning Automata: An Introduction”, Prentice Hall, 1989.
Meybodi, M. R. and Beigy, H., “New Class of Learning Automata Based Scheme for Adaptation of Back-Propagation Algorithm Parameters”, Proceedings of EUFIT-98, Aachen, Germany, pp. 339–344, Sept. 7–10, 1998.
Oommen, B. J. and Ma, D. C. Y., “Deterministic Learning Automata Solution to the Keyboard Optimization Problem”, IEEE Transactions on Computers, Vol. 37, No. 1, pp. 2–3, 1988. DOI: https://doi.org/10.1109/12.75146
Beigy, H. and Meybodi, M. R., “Optimization of Topology of Neural Networks Using Learning Automata”, Proceedings of the 3rd Annual International Computer Society of Iran Computer Conference (CSICC-98), Tehran, Iran, pp. 417–428, 1999.
Wenming Li, Krishna Kavi, Robert Akl, ScienceDirect, “A Nonpreemptive Scheduling Algorithm for Soft Real-Time Systems”, 2007.
Adam, T. L., Chandy, K. M., Dickson, J. R., “A Comparison of List Schedules for Parallel Processing Systems”, Communications of the ACM, Vol. 17, pp. 685–690, 1974. DOI: https://doi.org/10.1145/361604.361619
Buttazzo, G. C., “Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications”, 2nd ed., Springer-Verlag, New York, 2004.
Chen, H., Maheswaran, “Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems”, Proceedings of the 2002 International Parallel and Distributed Processing Symposium (IPDPS 2002), Fort Lauderdale, FL, April 2002.
Cheng, B. C., Stoyenko, A. D., Marlowe, T. J., Baruah, S. K., “LSTF: A New Scheduling Policy for Complex Real-Time Tasks in Multiple Processor Systems”, Automatica, Vol. 33, No. 5, pp. 921–926, 1997. DOI: https://doi.org/10.1016/S0005-1098(96)00245-2
Feng, W. C., “Applications and Extensions of the Imprecise Computation Model”, Ph.D. Thesis, University of Illinois at Urbana-Champaign, 1996.
Feng, W. C., Liu, J. W. S., “Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines”, IEEE Transactions on Software Engineering, Vol. 23, pp. 93–106, 1997. DOI: https://doi.org/10.1109/32.585499
Han, C. C., Shin, K. G., Wu, J., “A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults”, IEEE Transactions on Computers, Vol. 52, 2003. DOI: https://doi.org/10.1109/TC.2003.1183950
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Yosef Masoudi, Shahriar Lotfi, Davod Karimzadgan (Author)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
