An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems

  • Hong Jin
  • Hui Wang
  • Hongan Wang
  • Guozhong Dai
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3959)


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.


Schedule Problem Travel Salesman Problem Travel Salesman Problem Task Assignment Control Task 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)MATHCrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Baruah, S.K., Goossens, J.: Rate-monotonic scheduling on uniform multiprocessors. IEEE Trans. on Computers 52(7), 966–970 (2003)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theoretical Computer Science 344, 243–278 (2005)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Blum, C., Sampels, M.: An ant colony optimization algorithm for shop scheduling problems. Journal of Mathematical Modelling Algorithms 3(3), 285–308 (2004)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resourceconstrained project scheduling. IEEE Trans. on Evolutionary Computation 6(4), 333–346 (2002)CrossRefGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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-ProgressGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hong Jin
    • 1
  • Hui Wang
    • 1
  • Hongan Wang
    • 1
  • Guozhong Dai
    • 1
  1. 1.Institute of SoftwareChinese Academy of SciencesBeijing

Personalised recommendations