Solving traveling salesman problem on cluster compute nodes

I.A., Aziz and Haron, N. and Mehat, M. and Jung, L.T. and Mustapa, A.N. and Akir, E.A.P. (2009) Solving traveling salesman problem on cluster compute nodes. WSEAS Transactions on Computers, 8 (6). pp. 1020-1029. ISSN 11092750

[img] PDF (Solving traveling salesman problem on cluster compute nodes) - Published Version
Restricted to Registered users only



In this paper, we present a parallel implementation of a solution for the Traveling Salesman Problem (TSP). TSP is the problem of finding the shortest path from point A to point B, given a set of points and passing through each point exactly once. Initially a sequential algorithm is fabricated from scratch and written in C language. The sequential algorithm is then converted into a parallel algorithm by integrating it with the Message Passing Interface (MPI) libraries so that it can be executed on a cluster computer. Our main aim by creating the parallel algorithm is to accelerate the execution time of solving TSP. Experimental results conducted on Beowulf cluster are presented to demonstrate the viability of our work as well as the efficiency of the parallel algorithm.

Item Type:Article
Uncontrolled 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
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments / MOR / COE:Departments > Computer Information Sciences
ID Code:167
Deposited By: Izzatdin A Aziz
Deposited On:24 Feb 2010 14:46
Last Modified:19 Jan 2017 08:25

Repository Staff Only: item control page

Document Downloads

More statistics for this item...