An e cient parallel cluster { heuristicfor large
نویسندگان
چکیده
1994 Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 80 D{50931 K oln Abstract We describe an improved clustering heuristic for the Eucledian Traveling Salesman Problem and its parallelization for a distributed memory machine. A geometric decomposition is used for the clustering{stage and special emphasis has been put on the computation of the global tour through the clusters. The heuristic solves problem instances up to 33,000 cities in a few minutes on the parallel machine, while the obtained tour is only a few percent longer than a tour generated by the sequential Lin{Kernighan{algorithm.
منابع مشابه
An e cient parallel cluster { heuristicfor large Traveling Salesman
1994 Zentrum f ur Paralleles Rechnen Universit at zu K oln Weyertal 80 D{50931 K oln Abstract We describe an improved clustering heuristic for the Eucledian Traveling Salesman Problem and its parallelization for a distributed memory machine. A geometric decomposition is used for the clustering{stage and special emphasis has been put on the computation of the global tour through the clusters. Th...
متن کاملSupporting parallel computing on a distributed object architecture
The availability of high-speed networks and increasingly powerful commodity microprocessors is making the usage of clusters, or networks, of computers an appealing platform for cost eective parallel computing. However, the ease of developing ecient high-performance parallel software to exploit these platforms presents a major challenge. Advances in distributed object software technology have ...
متن کاملImplementation and Evaluation of an E cient D Parallel Delaunay Triangulation Algorithm
This paper describes the derivation of an empirically e cient parallel two dimensional Delaunay triangulation program from a theoretically e cient CREW PRAM algorithm Compared to pre vious work the resulting implementation is not limited to datasets with a uniform distribution of points achieves signi cantly better speedups over good serial code and is widely portable due to its use of MPI as a...
متن کاملEfficiency Evaluation of Pvm X Pvm X P Express and Linda on a Workstation Cluster Using the Nas Parallel Benchmarks
When developing programs for a network of workstations a tedious and time con suming task consists of handling the communication and synchronization in a correct and e cient way Correct means in this context that it is guaranteed that each pro cess running on a particular machine will receive the appropriate data and that the program will not deadlock With the term e cient we mean a minimum amo...
متن کاملImplementation and Evaluation of an E cient Parallel Delaunay Triangulation Algorithm
This paper describes the derivation of an empirically e cient parallel two dimensional Delaunay triangulation pro gram from a theoretically e cient CREW PRAM algorithm Compared to previous work the resulting implementation is not limited to datasets with a uniform distribution of points achieves signi cantly better speedups over good serial code and is widely portable due to its use of MPI as a...
متن کامل