Please use this identifier to cite or link to this item:
https://doi.org/10.1109/TC.2012.194
Title: | Quality-driven dynamic scheduling for real-time adaptive applications on multiprocessor systems | Authors: | Yu, H. Ha, Y. Veeravalli, B. |
Keywords: | Adaptiveness Embedded multiprocessors quality-of-service Scheduling |
Issue Date: | 2013 | Citation: | Yu, H., Ha, Y., Veeravalli, B. (2013). Quality-driven dynamic scheduling for real-time adaptive applications on multiprocessor systems. IEEE Transactions on Computers 62 (10) : 2026-2040. ScholarBank@NUS Repository. https://doi.org/10.1109/TC.2012.194 | Abstract: | While quality-adaptable applications are gaining increased popularity on embedded systems (especially multimedia applications), efficient scheduling techniques are necessary to explore this feature to achieve the optimal quality output. In addition to conventional real-time requirements, emerging challenges such as leakage power and multiprocessors further complicate the formulation and solution of adaptive application scheduling problems. In this paper, we propose a dynamic adaptive application scheduling scheme that efficiently distributes the runtime slack to achieve maximized execution quality under timing and dynamic/leakage energy constraints. Our proposed methods are threefold: First, for each task in the slack receiver group, a heuristic guided-search algorithm is proposed to select the optimal processor frequency to maximize the application execution quality. Second, we present an efficient slack receiver selection methodology aiming at identifying optimal slack receivers for quality maximization. Third, our framework is further extended to consider constraints brought by interprocessor communications, where we study the effects of slack inaccuracies introduced by transmission variations, and propose a local scaling approach to compensate the induced quality loss. Experimental results on synthesized tasks and a JPEG2000 codec show that the guided-search algorithm, aided by slack receiver selection, effectively outperforms contemporary approaches with at most 88 percent more quality improvement, whereas the local scaling contributes as large as 16.9 percent on top of the guided-search results. © 1968-2012 IEEE. | Source Title: | IEEE Transactions on Computers | URI: | http://scholarbank.nus.edu.sg/handle/10635/57167 | ISSN: | 00189340 | DOI: | 10.1109/TC.2012.194 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.