Real-time Scheduling for (m,k)-firm Deadline Tasks on Energy-constrained Multiprocessors


KIPS Transactions on Computer and Communication Systems, Vol. 2, No. 6, pp. 237-244, Jun. 2013
10.3745/KTCCS.2013.2.6.237,   PDF Download:

Abstract

We propose Energy-constrained Multiprocessor Real-Time Scheduling algorithms for (m,k)-firm deadline constrained tasks (EMRTS-MK). Rather than simply saving as much energy as possible, we consider energy as hard constraint under which the system remains functional and delvers an acceptable performance at least during the prescribed mission time. We evaluate EMRTS-MKs in several experiments, which quantitatively show that they achieve the scheduling objectives.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. Kong and H. Cho, "Real-time Scheduling for (m,k)-firm Deadline Tasks on Energy-constrained Multiprocessors," KIPS Transactions on Computer and Communication Systems, vol. 2, no. 6, pp. 237-244, 2013. DOI: 10.3745/KTCCS.2013.2.6.237.

[ACM Style]
Yeonhwa Kong and Hyeonjoong Cho. 2013. Real-time Scheduling for (m,k)-firm Deadline Tasks on Energy-constrained Multiprocessors. KIPS Transactions on Computer and Communication Systems, 2, 6, (2013), 237-244. DOI: 10.3745/KTCCS.2013.2.6.237.