Skip to main navigation Skip to search Skip to main content

Multiprocessor Energy-Efficient Scheduling for Real-Time Tasks with Different Power Characteristics

  • Jian-Jia Chen
  • , Tei-Wei Kuo

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

In the past decades, a number of research results have been reported for energy-efficient scheduling over uniprocessor and multiprocessor environments. Different from many of the past results on the assumption for task power characteristics, we consider real-time scheduling of tasks with different power characteristics. The objective is to minimize the energy consumption of task executions under the given deadline constraint. When tasks have a common deadline and are ready at time 0, we propose an optimal real-time task scheduling algorithm for multiprocessor environments with the allowance of task migration. When no task migration is allowed, a 1.412-approximation algorithm for task scheduling is proposed for different settings of power characteristics. The performance of the approximation algorithm was evaluated by an extensive set of experiments, where excellent results were reported.
Original languageEnglish
Title of host publicationProceedings - 2005 International Conference on Parallel Processing
EditorsWu-chun Feng, José Duato
Pages13-20
DOIs
Publication statusPublished - Jun 2005
Externally publishedYes
Event34th International Conference on Parallel Processing (ICPP 2005) - Oslo, Norway
Duration: 14 Jun 200517 Jun 2005

Publication series

NameProceedings of the International Conference on Parallel Processing
Volume2005
ISSN (Print)0190-3918

Conference

Conference34th International Conference on Parallel Processing (ICPP 2005)
PlaceNorway
CityOslo
Period14/06/0517/06/05

Fingerprint

Dive into the research topics of 'Multiprocessor Energy-Efficient Scheduling for Real-Time Tasks with Different Power Characteristics'. Together they form a unique fingerprint.

Cite this