Issue No. 01 - Jan. (2013 vol. 62)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2011.203
Michele Lombardi , University of Bologna, Bologna
Michela Milano , University of Bologna, Bologna
Luca Benini , University of Bologna, Bologna
Effective multicore computing requires to make efficient usage of the computational resources on a chip. Offline mapping and scheduling can be applied to improve the performance, but classical approaches require considerable a priori knowledge of the target application. In a practical setting, precise information is often unavailable; one can then resort to approximate time and resource usage figures, but this usually requires to make conservative assumptions. The issue is further stressed if real-time guarantees must be provided. We tackle predictable and efficient nonpreemptive scheduling of multitask applications in the presence of duration uncertainty. Hard real-time guarantees are provided with limited idle time insertion, by exploiting a hybrid offline/online technique known as Precedence Constraint Posting (PCP). Our approach does not require probability distributions to be specified, relying instead on simple and cheaper-to-obtain information (bounds, average values). The method has been tested on synthetic applications/platforms and compared with an offline optimized Fixed Priority Scheduling (FPS) approach and a pure online FIFO scheduler; the results are very promising, as the PCP schedules exhibit good stability and improved average execution time (14 percent on average, up to 30 percent versus FPS and up to 40 percent versus the FIFO scheduler).
Schedules, Scheduling, Processor scheduling, Uncertainty, Resource management, Programming, Real time systems, optimization, Scheduling, uncertain execution and communication times, task graph, multicore, precedence constraint posting
M. Milano, M. Lombardi and L. Benini, "Robust Scheduling of Task Graphs under Execution Time Uncertainty," in IEEE Transactions on Computers, vol. 62, no. , pp. 98-111, 2013.