Advertisement

Allocation of Parallel Real-Time Tasks in Distributed Multi-core Architectures Supported by an FTT-SE Network

  • Ricardo Garibay-MartínezEmail author
  • Geoffrey Nelissen
  • Luis Lino Ferreira
  • Luís Miguel Pinho
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9017)

Abstract

Distributed real-time systems such as automotive applications are becoming larger and more complex, thus, requiring the use of more powerful hardware and software architectures. Furthermore, those distributed applications commonly have stringent real-time constraints. This implies that such applications would gain in flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of allocating fixed-priority fork-join Parallel/Distributed real-time tasks onto distributed multi-core nodes connected through a Flexible Time Triggered Switched Ethernet network. We analyze the system requirements and present a set of formulations based on a constraint programming approach. Constraint programming allows us to express the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution, if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint programming have shown to obtain solutions for these type of formulations in reasonable time.

Keywords

Constraint programming Real-time Parallel tasks   Distributed multi-core architectures 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Garibay-Martínez, R., Nelissen, G., Ferreira, L.L., Pinho, L.M.: On the scheduling of fork-join parallel/distributed real-time tasks. In: 9th IEEE International Symposium on Industrial Embedded Systems, pp. 31–40, June 2014Google Scholar
  2. 2.
    Marau, R., Almeida, L., Pedreiras, P.: Enhancing real-time communication over cots ethernet switches. In: IEEE International Workshop on Factory Communication Systems, pp. 295–302 (2006)Google Scholar
  3. 3.
    Zhu, Q., Zeng, H., Zheng, W., Natale, M.D., Sangiovanni-Vincentelli, A.: Optimization of task allocation and priority assignment in hard real-time distributed systems. ACM Transactions on Embedded Computing Systems 11(4), 85 (2012)CrossRefGoogle Scholar
  4. 4.
    Metzner, A., Herde, C.: Rtsat-an optimal and efficient approach to the task allocation problem in distributed architectures. In: 27th IEEE Real-Time Systems Symposium, pp. 147–158, December 2006Google Scholar
  5. 5.
    Lakshmanan, K., Kato, S., Rajkumar, R.: Scheduling parallel real-time tasks on multi-core processors. In: 31st IEEE Real-Time Systems Symposium, pp. 259–268, November 2010Google Scholar
  6. 6.
    Fisher, N., Baruah, S., Baker, T.P.: The partitioned scheduling of sporadic tasks according to static-priorities. In: 18th Euromicro Conference on Real-Time Systems, p. 10 (2006)Google Scholar
  7. 7.
    Fauberteau, F., Midonnet, S., Qamhieh, M.: Partitioned scheduling of parallel real-time tasks on multiprocessor systems. ACM SIGBED Review 8(3), 28–31 (2011)CrossRefGoogle Scholar
  8. 8.
    Saifullah, A., Li, J., Agrawal, K., Lu, C., Gill, C.: Multi-core real-time scheduling for generalized parallel task models. Real-Time Systems 49(4), 404–435 (2013)CrossRefzbMATHGoogle Scholar
  9. 9.
    Qamhieh, M., George, L., Midonnet, S.: A Stretching algorithm for parallel real-time DAG tasks on multiprocessor systems. In: 22nd International Conference on Real-Time Networks and Systems, p. 13, October 2014Google Scholar
  10. 10.
    Tindell, K.W., Burns, A., Wellings, A.J.: Allocating hard real-time tasks: an NP-hard problem made easy. Real-Time Systems 4(2), 145–165 (1992)CrossRefGoogle Scholar
  11. 11.
    García, J.G., Harbour, M.G.: Optimized priority assignment for tasks and messages in distributed hard real-time systems. In: Third IEEE Workshop on Parallel and Distributed Real-Time Systems, pp. 124–132, April 1995Google Scholar
  12. 12.
    Azketa, E., Uribe, J.P., Gutiérrez, J.J., Marcos, M., Almeida, L.: Permutational genetic algorithm for the optimized mapping and scheduling of tasks and messages in distributed real-time systems. In: 10th International Conference on Trust, Security and Privacy in Computing and Communications (2011)Google Scholar
  13. 13.
    Leung, J.Y.T., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2(4), 237–250 (1982)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Tindell, K., Clark, J.: Holistic schedulability analysis for distributed hard real-time systems. Microprocessing and Microprogramming 40(2), 117–134 (1994)CrossRefGoogle Scholar
  15. 15.
    Palencia, J.C., Gonzalez Harbour, M.: Schedulability analysis for tasks with static and dynamic offsets. In: 19th IEEE Real-Time Systems Symposium, pp. 26–37, December 1998Google Scholar
  16. 16.
    Palencia, J.C., Gonzalez Harbour, M.: Exploiting precedence relations in the schedulability analysis of distributed real-time systems. In: 20th IEEE Real-Time Systems Symposium, pp. 328–339 (1999)Google Scholar
  17. 17.
    Garibay-Martínez, R., Nelissen G., Ferreira L.L., Pinho L.M.: Task partitioning and priority assignment for hard real-time distributed systems. In: International Workshop on Real-Time and Distributed Computing in Emerging Applications (2013)Google Scholar
  18. 18.
    Audsley, N.C.: Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. University of York, Dep. of Computer Science (1991)Google Scholar
  19. 19.
    Richard, M., Richard, P., Cottet, F.: Allocating and scheduling tasks in multiple fieldbus real-time systems. In: IEEE Conference on Emerging Technologies and Factory Automation, pp. 137–144, September 2003Google Scholar
  20. 20.
    Joseph, M., Pandya, P.: Finding response times in a real-time system. The Computer Journal 29(5), 390–395 (1986)CrossRefMathSciNetGoogle Scholar
  21. 21.
    Ashjaei, M., Behnam, M., Nolte, T., Almeida, L.: Performance analysis of master-slave multi-hop switched ethernet networks. In: 8th IEEE International Symposium Industrial Embedded Systems, pp. 280–289, June 2013Google Scholar
  22. 22.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, vol. 2, pp. 531–549. MIT Press, Cambridge (2001)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Ricardo Garibay-Martínez
    • 1
    Email author
  • Geoffrey Nelissen
    • 1
  • Luis Lino Ferreira
    • 1
  • Luís Miguel Pinho
    • 1
  1. 1.CISTER/INESC-TEC Research CentreISEP/IPPPortoPortugal

Personalised recommendations