Towards a coordination model for parallel cooperative P2P multi-objective optimization

7Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Existing Dispatcher-Worker Peer-to-Peer (P2P) computing environments are well-suited for multi-parameter applications. However, they are limited regarding the parallel computing where the generated tasks need to communicate. In this paper, we investigate that limitation and propose a coordination model for parallel P2P multi-objective optimization (MOO). The model has been implemented on top of the XtremWeb middleware. Then, it has been experimented on a combinatorial optimization application: a parallel branch-and-bound algorithm applied to the multi-objective (MO) Flow-Shop scheduling problem. The preliminary results obtained on a network of 120 heterogeneous PCs demonstrate the efficiency of the proposed approach. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Mezmaz, M., Melab, N., & Talbi, E. G. (2005). Towards a coordination model for parallel cooperative P2P multi-objective optimization. In Lecture Notes in Computer Science (Vol. 3470, pp. 305–314). Springer Verlag. https://doi.org/10.1007/11508380_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free