Welcome To UTPedia

We would like to introduce you, the new knowledge repository product called UTPedia. The UTP Electronic and Digital Intellectual Asset. It stores digitized version of thesis, dissertation, final year project reports and past year examination questions.

Browse content of UTPedia using Year, Subject, Department and Author and Search for required document using Searching facilities included in UTPedia. UTPedia with full text are accessible for all registered users, whereas only the physical information and metadata can be retrieved by public users. UTPedia collaborating and connecting peoples with university’s intellectual works from anywhere.

Disclaimer - Universiti Teknologi PETRONAS shall not be liable for any loss or damage caused by the usage of any information obtained from this web site.Best viewed using Mozilla Firefox 3 or IE 7 with resolution 1024 x 768.

Travelling Salesman Problem using Prim Algorithm in High Performance Computing

Wan Harun, Wan Nurhafizah (2007) Travelling Salesman Problem using Prim Algorithm in High Performance Computing. Universiti teknologi petronas. (Unpublished)

[img] PDF
Download (791Kb)


Thanks to the advances in wide area network technology and the low cost of computing resources, High Performance Computing came into being and currently research area. One incentive of High Performance Computing is to summative the power of widely distributed resources, and provide non-trivial services to users. To achieve this goal an efficient job scheduling algorithm system is an essential part of the High Performance Computing. This preliminary report emphasizes on the basic terms of the efficient job scheduling algorithm for traveling salesman problem in high performance computing. Job scheduling algorithm will reduce the traffic between the processors and can help improve resource utilization and quality of service. Traveling salesman problem is finding is the shortest path connecting number of locations such as cities, visited by a traveling salesman on his sales route. TSP has been used in The Two-Period Travelling Salesman Problem Applied to Milk Collection in Ireland and Usefulness of Solution Algorithms of the Travelling Salesman Problem in the typing of Biological Sequences in a Clinical Laboratory Setting.

Item Type: Final Year Project
Academic Subject : Academic Department - Information Communication Technology
Subject: Z Bibliography. Library Science. Information Resources > ZA Information resources
Divisions: Sciences and Information Technology > Computer and Information Sciences
Depositing User: Users 2053 not found.
Date Deposited: 24 Oct 2013 09:15
Last Modified: 25 Jan 2017 09:45
URI: http://utpedia.utp.edu.my/id/eprint/9561

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...