کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
460493 | 696380 | 2015 | 9 صفحه PDF | دانلود رایگان |
• Optimization of periodic message scheduling in a real-time multiprocessor system.
• Use of the space-sharing concept for a many-core architecture on a single chip.
• An efficient heuristic based on a generalized graph coloring model.
• Experiments on realistic scenarios show the effectiveness of the algorithm.
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.
Journal: Journal of Systems Architecture - Volume 61, Issue 8, September 2015, Pages 374–382