eprintid: 703
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/07/03
datestamp: 2023-11-09 15:48:51
lastmod: 2023-11-09 15:48:51
status_changed: 2023-11-09 15:22:59
type: article
metadata_visibility: show
creators_name: Aziz, I.A.
creators_name: Haron, N.
creators_name: Mehat, M.
creators_name: Jung, L.T.
creators_name: Mustapa, A.N.
creators_name: Akir, E.A.P.
title: Solving traveling salesman problem on cluster compute nodes
ispublished: pub
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
note: cited By 4
abstract: 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.
date: 2009
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-69349090796&partnerID=40&md5=d482566bc38cb46d9a7a27f251e0db92
full_text_status: none
publication: WSEAS Transactions on Computers
volume: 8
number: 6
pagerange: 1020-1029
refereed: TRUE
issn: 11092750
citation:   Aziz, I.A. 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