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

A dynamic sender-initiated load sharing algorithm for cluster with reduced polling

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)
Sandhya, K.V. ; Dept. of Comput. Sci., Karpagam Univ., Coimbatore, India ; Raju, G.

It is very important that algorithms used in cluster do the work in the shortest time possible. Only efficient communication between the cluster nodes can improve the performance of a cluster. Considering this aspect, redundancy of work can be avoided if nodes share information. The proposed algorithm is based on the idea of sharing of information already acquired by nodes so that less work is done by individual nodes for load distribution. The algorithm focuses on improving the performance of a cluster computing environment, by sharing cluster statistics information between individual nodes and thus reduces the time taken to find valid receivers. The implementation of the algorithm using a simulator is ongoing work.

Published in:

Recent Trends in Information Systems (ReTIS), 2011 International Conference on

Date of Conference:

21-23 Dec. 2011

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.