By Topic

Performance evaluation of on-line scheduling algorithms for imprecise computation

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)
Jai-Hoon Kim ; Ajou Univ., Suwon, South Korea ; Kihyun Song ; Kyunghee Choi ; Gihyun Jung
more authors

This paper presents an algorithm for scheduling imprecise tasks to minimize maximum error and analyzes its performance through intensive simulation. The imprecise computation is used to manage transient overload of computation. Each task for imprecise systems consists of a mandatory part and an optional part that can be skipped when systems are overloaded. The imprecise computation trades accuracy for meeting the deadline of tasks by skipping their optional parts. To increase accuracy for imprecise computation, we present a simple on-line scheduling algorithm that minimizes the maximum error. This algorithm executes mandatory parts of tasks first, then the optional parts in order to minimize maximum error. The proposed algorithm also increases schedulability by executing mandatory parts first. The proposed algorithm is simple and does not require any additional data structures such as the reservation list for maintaining mandatory parts

Published in:

Real-Time Computing Systems and Applications, 1998. Proceedings. Fifth International Conference on

Date of Conference:

27-29 Oct 1998