By Topic

Time Stamp-Based Algorithm for Task Scheduling in a Distributed Computing System with Multiple Master Multiple Slave Architecture

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

6 Author(s)
Dhurandher, S.K. ; Div. of Inf. Technol., Univ. of Delhi, New Delhi, India ; Aggarwal, A. ; Bhandari, A. ; Obaidat, M.S.
more authors

Distributed computing provides solution to fundamental requirement of high computational capacity for numerous complex problems in the fields of quantum physics, weather forecasting, and molecular biology. This computational ability is the result of combining computation capacity of multiple nodes together in a distributed computing system. The initialization and maintenance of the whole structure and load scheduling are the primary tasks to be accomplished for successful results. In this paper, we propose a timestamp-based algorithm for task scheduling in a DCS with Multiple Master Multiple Slaves (MMMS) architecture. This algorithm provides a practical and optimized way of task scheduling while maintaining scalability, fault-tolerance, network structure and high efficiency. Towards the end of this paper, we have shown the performance analysis of task scheduling for patronizing our claims about the load balancing achieved in the system.

Published in:

Internet of Things (iThings/CPSCom), 2011 International Conference on and 4th International Conference on Cyber, Physical and Social Computing

Date of Conference:

19-22 Oct. 2011