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
DOI Bookmark:
http://doi.ieeecomputersociety.org/10.1109/ISPDC.2004.37
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.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb