By Topic

Task Migration with EDF-RM Scheduling Algorithms in Distributed System

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)
Sharma, R. ; Dept. of CSE & ICT, Jaypee Univ. of Inf. Technol., Solan, India ; Nitin

Earliest deadline first and Rate Monotonic are the two well-known scheduling algorithms to meet the deadlines for task in RTS. For single processor, these tasks work well but for more than one node, overloading in utilization usually creates problem. Task migration and duplication are those two concepts that balance the load of distributed system due to which overloading problem has been resolved. This paper explains the processing of task migration with EDF-RM (simultaneously) scheduling algorithm by using Global Scheduling.

Published in:

Advances in Computing and Communications (ICACC), 2012 International Conference on

Date of Conference:

9-11 Aug. 2012