Cart (Loading....) | Create Account
Close category search window

A Post-Scheduling Optimization Algorithm of Distributed Real-Time Tasks

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

3 Author(s)
Ming Fang ; Harbin Engineering University, Harbin, China ; You-guang Yuan ; Hong-tao Liang

To overcome the disadvantages of existing algorithms in scheduling distributed real-time tasks, this paper proposes a post-scheduling optimization algorithm (PSO) based on a novel structure called Scheduled Clusters Tree. As the experiments shows, PSO can minimize the number of required processors without affecting the optimal scheduling length generated by duplication-based algorithms, e.g., TDS or OSA algorithm. The time complexity of PSO algorithm is O(d|V|2) when TDS is adopted, or O(d2|V|2) when OSA is adopted. Where |V| is the number of tasks and d is the maximum degree of tasks in the corresponding DAG.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on

Date of Conference:

05-08 Dec. 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.