By Topic

Pro-active task sharing in a self-organizing server cluster

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

1 Author(s)
Senbel, S.A. ; Coll. of Comput. & Inf. Technol., Arab Acad. for Sci., Technol., & Maritime Transp., Cairo

We present a dynamic self-organizing design for a server cluster that dynamically allocates jobs to servers in a server cluster, while maintaining certain QoS objectives, mainly a guaranteed maximum response time. Our design is based upon providing autonomy for each node in the cluster by having the node maintain only partial information about the system and having a mechanism for each node to process jobs or redirect it to a neighbor node. We introduce a new technique for load balancing to be implemented by nodes with low utilization that drastically reduces the job rejection ratio as well as the average response time. The basic idea is for low-utilization nodes to aggressively advertise themselves to high-utilization nodes as candidate neighbors, and to attempt to ldquograbrdquo jobs from the job queues of more busy neighbors. Our new technique is compared to other techniques and it performed well in all metrics: rejection ratio, average job response time, average node utilization, and reaction to an overload situation.

Published in:

Computers and Communications, 2008. ISCC 2008. IEEE Symposium on

Date of Conference:

6-9 July 2008