loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04)
Parallel Framework for Ant-Like Algorithms
Cork, Ireland
July 05-July 07
ISBN: 0-7695-2210-6
ASCII Text
x 
 
Mitică Craus, Laurenţiu Rudeanu, "Parallel Framework for Ant-Like Algorithms," Parallel and Distributed Computing, International Symposium on, pp. 36-41, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ISPDC.2004.37,
author = {Mitică Craus and Laurenţiu Rudeanu},
title = {Parallel Framework for Ant-Like Algorithms},
journal ={Parallel and Distributed Computing, International Symposium on},
volume = {0},
year = {2004},
isbn = {0-7695-2210-6},
pages = {36-41},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPDC.2004.37},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing, International Symposium on
TI - Parallel Framework for Ant-Like Algorithms
SN - 0-7695-2210-6
SP36
EP41
A1 - Mitică Craus,
A1 - Laurenţiu Rudeanu,
PY - 2004
KW - null
VL - 0
JA - Parallel and Distributed Computing, International Symposium on
ER -
 
Mitică Craus, Technical University "Gh.Asachi"
Laurenţiu Rudeanu, Technical University "Gh.Asachi"

This paper describes the work of an objectual framework designed to be used in the parallelization of a set of related algorithms.

As a concrete application a parallel Ant Colony Optimization algorithm (ACO) for the Travelling Salesman Problem (TSP) is presented.

The idea behind the system we are describing is to have a re-usable framework for running several sequential algorithms in a parallel environment.

The algorithms that the framework can be used with have several things in common: they have to run in cycles and the work should be possible to be split between several "processing units".

The parallel framework uses the message-passing communication paradigm and is organized as a master-slave system.

The ACO for TSP implemented by means of the parallel framework proves to have good performances: approximatively linear speedup and low communication cost.

Citation:
Mitică Craus, Laurenţiu Rudeanu, "Parallel Framework for Ant-Like Algorithms," ispdc, pp.36-41, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.