An Energy-Efficient Task Scheduling Algorithm for Multi Processor Embedded System by Laxity Estimation 


Vol. 35,  No. 11, pp. 1631-1639, Nov.  2010


PDF
  Abstract

This paper proposes a scheduling algorithm that can reduce the power consumed for execution of application programs and the communication cost incurred due to dependencies among tasks. The proposed scheduling algorithm can increase energy efficiency of the DVS(Dynamic Voltage Scaling) by estimating laxity usage during scheduling, making up for conventional algorithms that apply the DVS after scheduling. Energy efficiency can be increased by applying the proposed algorithm to complex multimedia applications. Experimental results show that energy consumptions for executing HD MPEG4, MotionJPEG codec, MP3, and Wavelet have been reduced by 11.2% on the average, when compared to conventional algorithms.

  Statistics
Cumulative Counts from November, 2022
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]

B. Suh and S. Hwang, "An Energy-Efficient Task Scheduling Algorithm for Multi Processor Embedded System by Laxity Estimation," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 11, pp. 1631-1639, 2010. DOI: .

[ACM Style]

Beom-Sik Suh and Sun-Young Hwang. 2010. An Energy-Efficient Task Scheduling Algorithm for Multi Processor Embedded System by Laxity Estimation. The Journal of Korean Institute of Communications and Information Sciences, 35, 11, (2010), 1631-1639. DOI: .

[KICS Style]

Beom-Sik Suh and Sun-Young Hwang, "An Energy-Efficient Task Scheduling Algorithm for Multi Processor Embedded System by Laxity Estimation," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 11, pp. 1631-1639, 11. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880