By Topic

Two Post-Scheduling Optimization Algorithms for Distributed Real-Time Tasks Based on Scheduled Cluster Tree

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

2 Author(s)
Xiaofei Wang ; Sch.of Comput., Huazhong Univ. of Sci. & Technol., Wuhan ; Ming Fang

To overcome the disadvantages of the existing task duplication-based algorithms, this paper discusses the scheduling objectives of distributed real-time tasks, presents a novel structure called scheduled cluster tree, and proposes a general optimization method for various task duplication-based algorithms. According to the result of experiments, PSO_I and PSO_II are both general algorithms that improve the schedules generated by various task duplication-based algorithms. PSO_I aims to optimize the schedules in minimizing the number of required processors without affecting the optimal scheduling length acquired. PSO_II aims to increase the utilization of processors at the acceptable expense of the scheduling length (i.e., in the range of deadline) besides minimizing the number of required processors. The time complexities of both methods match approximately that of the typical task duplication-based algorithms, e.g., the task duplication based scheduling algorithm and the optimal scheduling algorithm based on task duplication

Published in:

Computer and Computational Sciences, 2006. IMSCCS '06. First International Multi-Symposiums on  (Volume:1 )

Date of Conference:

20-24 June 2006