By Topic

Efficient scheduling algorithms for real-time distributed 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
$33 $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)
Apurva Shah ; G H Patel College of Eng & Tech., Vallabh Vidyanagar, INDIA ; Ketan Kotecha

Dynamic scheduling has been always a challenging problem for real-time distributed systems. EDF (Earliest Deadline First) algorithm has been proved to be optimal scheduling algorithm for single processor real-time systems and it performs well for distributed systems also. In this paper, we have proposed scheduling algorithms for client/server distributed system with soft timing constraints. The algorithms are proposed with modifications in conventional EDF algorithm. The proposed algorithms are simulated; results are obtained and measured in terms of SR (Success Ratio) & ECU (Effective CPU Utilization). Finally the results are compared with EDF algorithm in the same environment. It has been observed that the proposed algorithms ares equally efficient during underloaded conditions and they perform much better during overloaded conditions.

Published in:

Parallel Distributed and Grid Computing (PDGC), 2010 1st International Conference on

Date of Conference:

28-30 Oct. 2010