Skip to main content
Log in

KTS: a real-time mapping algorithm for NoC-based many-cores

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Many-core architectures based on network-on-chip (NoC) are scalable and have the ability to meet the increasing performance requirements of complex concurrent applications (real-time video, communications, control, etc.). This paper addresses the mapping problem of hard real-time task sets on NoC-based many-core processors. Our main contribution is a novel static mapping scheme called K-level task splitting (KTS). If a task cannot be allocated on a given core of the NoC because of a too high processing utilization ratio, it gets replicated so that its jobs execute on more than one core without migrating. Synchronization between task replicas could then be ensured by assigning offsets and virtual deadlines to them. KTS’s advantage is that data migration is not required, thus involving no overheads due to migrations. The only requirement is that all core clocks be synchronized within the NoC. In this newly proposed algorithm, the schedulability of each task is determined based upon fundamental results relative to the feasibility analysis of asynchronous real-time task sets. The paper describes the principles of task splitting, our algorithm and its properties. We evaluate the efficiency of KTS, demonstrating that it is a good compromise between existing semi-partitioned schemes (with possible migrations) and fully partitioned approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Anderson J-H, Bud V, Devi U-C (2005) An EDF-based scheduling algorithm for multiprocessor soft real-time systems. In: Proceedings of the 17th IEEE Euromicro Conference on Real-Time Systems, pp 199–208

  2. Anderson J-H, Erickson J-P, Devi U-C, Casses B-N (2014) Optimal semi-partitioned scheduling in soft real-time systems. In: Proceedings of the 20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

  3. Baruah S-K, Rosier L-E, Howell R-R (1990) Algorithms and complexity: concerning the preemptive scheduling of periodic real-time tasks on one processor. Real-Time Syst J 2(4):301–324

    Article  Google Scholar 

  4. Bjerregaard T, Sparsø J (2005) Scheduling discipline for latency and bandwidth guarantees in asynchronous network-on-chip. In: Proceedings of the 11th IEEE International Symposium on Asynchronous Circuits and Systems, pp 34–43

  5. Buckler M (2014) Network-on-chip synchronization. Ph.D. thesis, University of Massachussetts

  6. Burns A, Davis R-I, Wang P, Zhang F (2012) Partitioned EDF scheduling for multiprocessors using a C\(=\)D scheme. Real-Time Syst J 48(1):3–33

    Article  MATH  Google Scholar 

  7. Chapiro D-M (1984) Globally asynchronous locally synchronous systems. Ph.D. thesis, Stanford University

  8. Hilbrich R, Van Kampenhout JR (2011) Partitioning and task transfer on NoC-based many-core processors in the avionics domain. Softwaretech Trends J Softwaretechnik-Trends 30(3):6

  9. Kasapaki E, Schoeberl M, Sorensen R-B, Muller C, Goossens K, Sparso J (2015) Argo: a real-time network-on-chip architecture with an efficient GALS implementation. IEEE Trans Very Large Scale Integr (VLSI) Syst 24(2):479–492

    Article  Google Scholar 

  10. Leung J-Y-T, Merill M-L (1980) A note on preemptive scheduling of periodic. Real-Time Tasks Inf Process Lett 11(3):115–118

    Article  Google Scholar 

  11. Leung J-Y-T, Whitehead J (1982) On the complexity of fixed-priority scheduling of periodic real-time tasks. Perform Eval 2:237–250

    Article  MathSciNet  MATH  Google Scholar 

  12. Lupu I, Courbin P, George L, Goossens J (2010) Multi-criteria evaluation of partitioning schemes for real-time systems. In: Proceedings of the IEEE Conference on Emerging Technologies and Factory Automation

  13. Martin A, Nystrom M (2006) Asynchronous techniques for system-on-chip design. Proc IEEE 94(6):1089–1120

    Article  Google Scholar 

  14. Milojicic D, Douglis F, Paindaveine Y, Wheeler R, Zhou S (2000) Process migration survey. ACM Comput Surv 32(8):241–299

  15. Palesi M, Daneshtalab M (2014) Routing algorithms in networks-on-chip. Springer, New York

    Book  Google Scholar 

  16. Sparso J (2004) Future networks-on-chip; will they be synchronous or asynchronous? In: Proceedings of the Swedish System on Chip Conference. Bastad, Sweden, pp 13–14

  17. Stankovic J-A (1988) Misconceptions about real-time computing: a serious problem for next-generation systems. Computer 21(10):10–19

    Article  Google Scholar 

  18. Tatas K, Siozios K, Soudris D, Jantsch A (2014) Designing 2D and 3D network-on-chip architectures. Springer, Berlin

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Audrey Queudet.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Queudet, A., Abdallah, N. & Chetto, M. KTS: a real-time mapping algorithm for NoC-based many-cores. J Supercomput 73, 3635–3651 (2017). https://doi.org/10.1007/s11227-017-1962-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-017-1962-5

Keywords

Navigation