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

An efficient optimal task allocation and scheduling algorithm for cyclic synchronous applications

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)
Hee-Jun Park ; Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; Byung Kook Kim

We present an efficient optimal algorithm that allocates and schedules cyclic synchronous tasks into fully connected processors. We consider applications with cyclic synchronous tasks with heavy communication traffic, which run on multiprocessors with a fully connected communication network. We suggest the computing period as the performance measure to minimize the overall computation time. We use an individual start policy for task scheduling, and also introduce concepts and characteristics of the local period and the global period. To solve the complicated optimal scheduling problem in an efficient way, we propose a new spatial scheduling technique using scheduling space which represents all possible schedules in multi-dimensional space. By using spatial searching and an enhanced branch-and-bound technique, the optimal task allocation and schedule which minimizes the computing period can be found efficiently. Various examples and scheduling results show the efficiency of the proposed algorithm

Published in:

Real-Time Computing Systems and Applications, 1999. RTCSA '99. Sixth International Conference on

Date of Conference:


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.