Message scheduling for real-time interprocessor communication

Autor(en): Waldherr, Stefan 
Knust, Sigrid 
Aust, Stefan
Stichwörter: ALGORITHMS; Baseline network; Computer Science; Computer Science, Hardware & Architecture; Computer Science, Software Engineering; Graph coloring; Message scheduling; Periodic scheduling; Real time
Erscheinungsdatum: 2015
Herausgeber: ELSEVIER
Volumen: 61
Ausgabe: 8
Startseite: 374
Seitenende: 382
In this paper an efficient algorithm is proposed which optimizes periodic message scheduling in a real-time multiprocessor system. The system is based on a many-core single-chip computer architecture and uses a multistage baseline network for inter-core communication. Due to its basic architecture, internal blockings can occur during data transfers, i.e. the baseline network is not real-time capable by itself. Therefore, we propose a scheduling algorithm that may be performed before the execution of an application in order to compute a non-blocking schedule of periodic message transfers. Additionally, we optimize the clock rate of the network subject to the constraint that all data transfers can be performed in a non-blocking way. Our solution algorithm is based on a generalized graph coloring model and a randomized greedy approach. The algorithm was tested on some realistic communication scenarios as they appear in modern electronic car units. Computational results show the effectiveness of the proposed algorithm. (C) 2015 Elsevier B.V. All rights reserved.
ISSN: 13837621
DOI: 10.1016/j.sysarc.2015.06.002

Show full item record

Page view(s)

Last Week
Last month
checked on Feb 27, 2024

Google ScholarTM