Skip to main navigation Skip to search Skip to main content

Energy-efficient tasks scheduling algorithm for dual-core real-time systems

  • Chang Gung University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

Real-time embedded devices have been widely used in our daily life. To satisfy the performance requirements, most current designs tend to apply the dual- or multi-core processor architecture in the systems. Such systems, however, usually have low power consumption demands. Therefore the Dynamic Voltage Scaling (DVS) technique has been included in most designs. In this paper, we focus our study on the energy-efficient task scheduling algorithm for the dual-core real-time systems. Our goal is to minimize the system's energy consumption and maintain the performance of task execution at the same time. To achieve this goal, we propose two approaches: off-line and on-line. For the off-line approach, we propose an Integer Linear Programming (ILP) based algorithm to find the optimal scheduling. For the on-line approach, we propose a heuristic algorithm. The experimental results show that the energy consumption can be reduced effectively by the heuristic algorithm, and is close to the optimal bounds obtained by the ILP model.

Original languageEnglish
Title of host publicationICS 2010 - International Computer Symposium
Pages568-575
Number of pages8
DOIs
StatePublished - 2010
Event2010 International Computer Symposium, ICS 2010 - Tainan, Taiwan
Duration: 16 12 2010 → 18 12 2010

Publication series

NameICS 2010 - International Computer Symposium

Conference

Conference2010 International Computer Symposium, ICS 2010
Country/TerritoryTaiwan
CityTainan
Period16/12/10 → 18/12/10

Keywords

  • Component
  • Dual-core real-time system
  • Energy-efficient task scheduling
  • Integer linear programming

Fingerprint

Dive into the research topics of 'Energy-efficient tasks scheduling algorithm for dual-core real-time systems'. Together they form a unique fingerprint.

Cite this