Abstract
In order to solve whether a set of periodic tasks can be assigned to a set of identical processors in such a way that all timing constraints can be met, the model of travelling salesman problem is used to describe the task assignment and scheduling in real-time multiprocessor control systems. Combined with the scheduling characteristics of multiprocessor systems, a new feasible algorithm based on ant colony optimization metaheuristic is presented for solving this problem. Both the scheduling performance index and the control performance index are proposed and used as fitness functions of optimization. Simulation results show that the proposed approach can solve the task assignment and scheduling problem in multiprocessor control systems.
This work is supported by China NSF under Grant No. 60373055, 60374058.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kim, B.K.: Control latency for task assignment and scheduling of multiprocessor real-time control systems. International Journal of System Science 30(1), 123–130 (1999)
Kimbrel, T., Schieber, B., Sviridenko, M.: Minimizing migrations in fair multiprocessor scheduling of persistent tasks. In: Proc. of the fifteenth annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 982–991 (2004)
Baruah, S.K., Goossens, J.: Rate-monotonic scheduling on uniform multiprocessors. IEEE Trans. on Computers 52(7), 966–970 (2003)
Baruah, S.K.: Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. IEEE Trans. on Computers 53(6), 781–784 (2004)
Braun, T.D., Siegel, H., Beck, N., et al.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing 61(6), 810–837 (2001)
Baruah, S.: Task partitioning upon heterogeneous multiprocessor platforms. In: Proc. of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 536–543 (2004)
Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theoretical Computer Science 344, 243–278 (2005)
Blum, C., Sampels, M.: An ant colony optimization algorithm for shop scheduling problems. Journal of Mathematical Modelling Algorithms 3(3), 285–308 (2004)
Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resourceconstrained project scheduling. IEEE Trans. on Evolutionary Computation 6(4), 333–346 (2002)
Velasco, M., Fuertes, J.M., Lin, C., Marti, P., Brandt, S.: A control approach to bandwidth management in networked control systems. In: Proc. of 30th Annual Conf. of IEEE Industrial Electronics Society, Busan, Korea, vol. 3, pp. 2343–2348 (2004)
Chen, H., Cheng, A.M.K.: Applying ant colony optimization to the partitioned scheduling problem for heterogeneous multiprocessors. SIGBED Review 2(2) (2005); Special Issue on IEEE RTAS 2005 Work-in-Progress
Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. on Evolutionary Computation 1(1), 53–56 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jin, H., Wang, H., Wang, H., Dai, G. (2006). An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_13
Download citation
DOI: https://doi.org/10.1007/11750321_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)