By Topic

A scalable task duplication based algorithm for improving the schedulability of real-time heterogeneous multiprocessor 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

2 Author(s)
Auluck, N. ; Center for Distributed & Mobile Comput., Cincinnati Univ., OH, USA ; Agrawal, D.P.

In this paper, we propose an O(v2) scalable duplication based algorithm (RT-SDA) for scheduling precedence constrained real-time tasks on heterogeneous multiprocessors. This models a network of workstations, with processors of varying computing power. The algorithm takes the heterogeneities of both computation and communication of the multiprocessor system into account. RT-SDA employs selective task duplication to reduce the start time of the real-time tasks in the job, thereby increasing the guarantee ratio of the real-time application. Moreover, our scheme is scalable in that the application can be scheduled even if the available number of processors is less than the required number of processors. Compared to the existing scheduling algorithms in the literature, RT-SDA offers better schedulability in terms of a higher guarantee ratio.

Published in:

Parallel Processing Workshops, 2003. Proceedings. 2003 International Conference on

Date of Conference:

6-9 Oct. 2003