Memory-processor co-scheduling for real-time tasks on network-on-chip manycore architectures Online publication date: Thu, 07-Apr-2022
by Chawki Benchehida; Mohammed Kamel Benhaoua; Houssam Eddine Zahaf; Giuseppe Lipari
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 11, No. 1, 2022
Abstract: The network-on-chip (NoC) provides a viable solution to bus-contention problems, that occur in classical manycore architectures. However, NoC complex design requires a particular attention to support the execution of real-time workloads. In this paper, we consider task-to-core allocation and inter-task communications, to guarantee the respect of timing constraints. In addition, we address task-to-main-memory communications, as it generates additional traffic. Rather than separating the problems of task-to-core allocation, inter-task communications, and memory-to-task data transfers separately, we tackle these problems at the same time for a set of real-time tasks modeled using directed acyclic graphs (DAGs). We propose an allocation algorithm and sequence of transformations to simplify the problem resolving and handle its combinatorial explosion. We evalaute the effectiveness of the proposed approaches using a large set of synthetic experiments.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook