By Topic

A memetic algorithm for distributed object allocations

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)
Pendharkar, P.C. ; Pennsylvania State Univ. at Harrisburg, Middletown, PA, USA

We propose a memetic algorithm based approach for allocating objects in distributed computing environment. Our allocation objective is to allocate objects to different servers so that the number of inter-server communications can be minimized. Assuming servers with similar processing and storage capabilities - to avoid biased allocation of the objects on servers with higher performance - we formulate the problem of allocating distributed objects as a graph bisection problem. Using simulated data, we use the memetic algorithm to solve the graph bisection problem. We compare the performance of the memetic algorithm with the Kernighan and Lin (KL) heuristic and semidefinite programming (SDP) lower bounds for graph bisection problem. The results of our experiments show that the memetic algorithm performs better or equal to the KL heuristic and has a relative performance gap of between 2-5% from the SDP lower bounds.

Published in:

Advanced Intelligent Mechatronics (AIM), 2010 IEEE/ASME International Conference on

Date of Conference:

6-9 July 2010