A memetic algorithm for distributed object allocations

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication2010 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2010
Pages140-144
Number of pages5
DOIs
StatePublished - Dec 1 2010
Event2010 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2010 - Montreal, QC, Canada
Duration: Jul 6 2010Jul 9 2010

Publication series

NameIEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM

Other

Other2010 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2010
CountryCanada
CityMontreal, QC
Period7/6/107/9/10

Fingerprint

Servers
Distributed computer systems
Communication
Processing
Experiments

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Software
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Pendharkar, P. C. (2010). A memetic algorithm for distributed object allocations. In 2010 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2010 (pp. 140-144). [5695715] (IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM). https://doi.org/10.1109/AIM.2010.5695715
Pendharkar, Parag C. / A memetic algorithm for distributed object allocations. 2010 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2010. 2010. pp. 140-144 (IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM).
@inproceedings{396321494a944b8aa1e02b741bc3edd4,
title = "A memetic algorithm for distributed object allocations",
abstract = "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.",
author = "Pendharkar, {Parag C.}",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/AIM.2010.5695715",
language = "English (US)",
isbn = "9781424480319",
series = "IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM",
pages = "140--144",
booktitle = "2010 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2010",

}

Pendharkar, PC 2010, A memetic algorithm for distributed object allocations. in 2010 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2010., 5695715, IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM, pp. 140-144, 2010 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2010, Montreal, QC, Canada, 7/6/10. https://doi.org/10.1109/AIM.2010.5695715

A memetic algorithm for distributed object allocations. / Pendharkar, Parag C.

2010 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2010. 2010. p. 140-144 5695715 (IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A memetic algorithm for distributed object allocations

AU - Pendharkar, Parag C.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79951593509&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79951593509&partnerID=8YFLogxK

U2 - 10.1109/AIM.2010.5695715

DO - 10.1109/AIM.2010.5695715

M3 - Conference contribution

AN - SCOPUS:79951593509

SN - 9781424480319

T3 - IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM

SP - 140

EP - 144

BT - 2010 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2010

ER -

Pendharkar PC. A memetic algorithm for distributed object allocations. In 2010 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM 2010. 2010. p. 140-144. 5695715. (IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM). https://doi.org/10.1109/AIM.2010.5695715