By Topic

Dynamic priority assignment based task scheduling for battery-powered portable systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yufeng Xie ; Tsinghua Univ., Beijing ; Muhua Han ; Liu, Leibo ; Rui Dai
more authors

In battery-powered portable devices, the most important design goal is maximizing the battery lifetime. This paper proposes a battery-aware task scheduling algorithm with dynamic priority assignment (DPA) to extend battery lifetime. Experiments show that compared with traditional task scheduling algorithms with static priority assignment (SPA), the proposed algorithm efficiently reduces battery cost (by up to 20.23%) and extends battery lifetime. Also, the proposed algorithm reduces complexity by average 37.45% and 4.6% compared with the most classical two SPA-based algorithms.

Published in:

ASIC, 2007. ASICON '07. 7th International Conference on

Date of Conference:

22-25 Oct. 2007