Solving traveling salesman problem on cluster compute nodes

WSEAS Transactions on Computers

Volumn 8, Issue 6, 2009, Pages 1020-1029

  Aziz, Izzatdin A ^a   Haron, Nazleeni ^a   Mehat, Mazlina ^a   Jung, Low Tan ^a   Mustapa, Aisyah Nabilah ^a   Akir, Emelia Akashah Patah ^a  

^a DEPARTMENT OF CHEMICAL ENGINEERING   (Malaysia)

Author keywords

High Performance Computing (HPC); Message Passing Interface (MPI); Traveling Salesman Problem (TSP)

Indexed keywords

BEOWULF CLUSTER; C LANGUAGE; CLUSTER COMPUTER; EXECUTION TIME; HIGH PERFORMANCE COMPUTING (HPC); MESSAGE PASSING INTERFACE (MPI); MESSAGE PASSING INTERFACE LIBRARIES; PARALLEL IMPLEMENTATIONS; SEQUENTIAL ALGORITHM; SHORTEST PATH;

CLUSTER COMPUTING; CLUSTERING ALGORITHMS; INTERFACES (COMPUTER); MESSAGE PASSING; PARALLEL ALGORITHMS; PROBLEM SOLVING; SEQUENTIAL SWITCHING;

TRAVELING SALESMAN PROBLEM;

EID: 69349090796     PISSN: 11092750     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. Selim G Aki, Stefan D Bruda, Improving A Solution's Quality Through Parallel Processing. The Journal of Supercomputing archive.Volume 19, Issue 2 (June 2001).
2. MPI Retrieved on May, 17 2008 from http://www-unix.mcs.anl.gov/mpi/
3. Dani Adhipta, Izzatdin Bin Abdul Aziz, Low Tan Jung, Nazleeni Binti Haron.Performance Evaluation on Hybrid Cluster: The Integration of Beowulf and Single System Image, Proceedings of ICTS,Jakarta. August 2006.
4. Delisle P., Krajecki M. et al, "Parallel implementation of an ant colony optimization metaheuristic with OPENMP", Proceedings of the 3rd European Workshop on OPENMP, Spain, Sep, 2001
5. Baraglia, R., Hidalgo, J. I., & Perego, R. A parallel hybrid heuristic for the TSP. In Proceedings of EvoCOP2001, the First European Workshop on Evolutionary Computation in Combinatorial Optimization, 193-202. 2001.
6. Ling Chen, Hai-Ying Sun, & Shu Wang, Parallel implementation of ant colony optimization on MPP. Proc. International Conference on Machine Learning and Cybernetics, Boading, 2008.
7. Tschoke, S., Luling, R., & Monien, B. (1995). Monien: Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 Processor Network. Proc. 9th Int. Parallel Processing Symp. (IPPS '95), 182-189.
8. Izzatdin Aziz, Nazleeni Haron, Low Tan Jung, WAN Rahaya Wan Dagang (2007)"Parallelization of Prime Number Generation Using Message Passing Interface" WSEAS Journal Transaction of Computers Volume 7 2008 ISSN: 1109-2750.
9. Dani Adhipta, Izzatdin Bin Abdul Aziz, Low Tan Jung, Nazleeni Binti Haron.Performance Evaluation on Hybrid Cluster: The Integration of Beowulf and Single System Image, Journal PLATFORM Volume 5 Number 1 January - June 2007, ISSN 1511-6794.
10. Yang L., Jin L., Integrating Parallel algorithm Design With Parallel Machine Models, ACM SIGCSE Bulletin, Vol. 27, Issue 1, Pg: 131-135, March 1995.
11. Manohar R., Zary S., Dalibor V., Implementation Machine Paradigm For Parallel Programming. In proceedings of ACM/IEEE 1990 Conference On Super-computing, Nov 1990.
12. A.J Sanchez Santiago,A.J Yuste, J.E Munoz Exposito, S Garcia Galan, J.M Maqueira Marin, S Bruque, "A Dynamic Balanced Scheduler for Genetic Algorithms for GRID Computing" Journal WSEAS Transaction on Computers, Issue 1 Volume 8, ISSN 1109-2750
13. Free Patents Online "Generalized shared memory in a cluster architecture for a computer system" http://www.freepatentsonline.com/EP0603801.html.
14. Weikuan Yu, Ranjit Noronha, Shuang Liang, Dhabaleswar K.Panda "Benefis of High Speed Interconnects to Cluster File Systems:A Case Study with Lustre" IEEEXplore, http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1639564