Issue No. 01 - January (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.104
R. Kumar , Dept. of Comput. Sci. & Eng., Indian Inst. of Technol. Kharagpur, Kharagpur, India
P. P. Chakrabarti , Dept. of Comput. Sci. & Eng., Indian Inst. of Technol. Kharagpur, Kharagpur, India
This paper presents an online scheduling methodology for task graphs with communication edges for multiprocessor embedded systems. The proposed methodology is designed for task graphs which are dynamic in nature either due to the presence of conditional paths or due to presence of tasks whose execution times vary. We have assumed homogeneous processors with broadcast and point-to-point communication models and have presented online algorithms for them. We show that this technique adapts better to variation in task graphs at runtime and provides better schedule length compared to a static scheduling methodology. Experimental results indicate up to 21.5 percent average improvement over purely static schedulers. The effects of model parameters like number of processors, memory, and other task graph parameters on performance are investigated in this paper.
processor scheduling, embedded systems, graph theory, schedule length, online scheduling, dynamic task graph, multiprocessor embedded system, homogeneous processor, broadcast communication model, point-to-point communication model, Program processors, Schedules, Dynamic scheduling, Optimal scheduling, Scheduling algorithm, edge scheduling., Multiprocessor scheduling, task graphs, static and online scheduling
R. Kumar, P. Choudhury and P. P. Chakrabarti, "Online Scheduling of Dynamic Task Graphs with Communication and Contention for Multiprocessors," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 126-133, 2012.