The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON COMPUTERS
Transactions ID Number: 32-340
Full Name: Izzatdin Abdul Aziz
Position: Lecturer
Age: ON
Sex: Male
Address: Computer and Information Sciences Department, Building 2, Universiti Teknologi PETRONAS, 31750 Tronoh Perak Malaysia
Country: MALAYSIA
Tel: +6053687495
Tel prefix:
Fax: +6053656180
E-mail address: izzatdin@petronas.com.my
Other E-mails: izzatdin@gmail.com
Title of the Paper: Solving Traveling Salesman Problem on Cluster Compute Nodes
Authors as they appear in the Paper: Izzatdin Abdul Aziz, Nazleeni Samiha Haron, Mazlina Mehat, Low Tan Jung, Aisyah Nabilah Mustafa, Emelia Akashah Patah Akhir
Email addresses of all the authors: izzatdin@petronas,com.my, nazleeni@petronas,com.my, mazlinamehat@petronas,com.my, lowtanjung@petronas,com.my,allysa85@yahoo.com, emeliaakashah@petronas.com.my
Number of paper pages: 10
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.
Keywords: Traveling Salesman Problem (TSP), High Performance Computing (HPC), Message Passing Interface (MPI)
EXTENSION of the file: .pdf
Special (Invited) Session:
Organizer of the Session:
How Did you learn about congress: Information Resource Centre, Universiti Teknologi PETRONAS, 31750 Tronoh Perak Malaysia
IP ADDRESS: 202.185.20.11
