The University of Southampton
University of Southampton Institutional Repository

Parallel algorithms for combinatorial optimization on transputer arrays

Parallel algorithms for combinatorial optimization on transputer arrays
Parallel algorithms for combinatorial optimization on transputer arrays

Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuristic algorithm, tend to be computationally intensive. This thesis investigates ways of utilizing MIMD architectures for two particular problems in combinatorial optimization; the travelling salesman problem and the (Δ D) graph problem. Firstly, some general principles of concurrent programming are described with reference to work done on an array of 1260 transputers. A distributed implementation of simulated annealing for the travelling salesman problem is then described. The problems of producing a general communication harness for a large processor network are discussed and a possible implementation is outlined. Methods of assessing the suitability of particular network topologies for such a harness are described, and a quantitative comparison is made between some networks using a idealized model of the behaviour of a harness. The (Δ, D) graph problem, that of finding the largest graph of given valency and diameter, is an abstract problem in graph theory relevant to the problem of choosing a good network for a multiprocesor computer. A heuristic algorithm to search for solutions to this problem is developed, based on Lin and Kernighan's algorithm for the travelling salesman problem. An incremental method for evaluating the effect of modifying a graph is described which results in a significant speedup of this algorithm. A result of this work has been the discovery of new maximal graphs, improving the records for largest known graphs to 41 for valency 4 and diameter 3, and to 132 for valency 7 and diameter 3.

University of Southampton
Allwright, James Robert Arthur
Allwright, James Robert Arthur

Allwright, James Robert Arthur (1990) Parallel algorithms for combinatorial optimization on transputer arrays. University of Southampton, Doctoral Thesis.

Record type: Thesis (Doctoral)

Abstract

Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuristic algorithm, tend to be computationally intensive. This thesis investigates ways of utilizing MIMD architectures for two particular problems in combinatorial optimization; the travelling salesman problem and the (Δ D) graph problem. Firstly, some general principles of concurrent programming are described with reference to work done on an array of 1260 transputers. A distributed implementation of simulated annealing for the travelling salesman problem is then described. The problems of producing a general communication harness for a large processor network are discussed and a possible implementation is outlined. Methods of assessing the suitability of particular network topologies for such a harness are described, and a quantitative comparison is made between some networks using a idealized model of the behaviour of a harness. The (Δ, D) graph problem, that of finding the largest graph of given valency and diameter, is an abstract problem in graph theory relevant to the problem of choosing a good network for a multiprocesor computer. A heuristic algorithm to search for solutions to this problem is developed, based on Lin and Kernighan's algorithm for the travelling salesman problem. An incremental method for evaluating the effect of modifying a graph is described which results in a significant speedup of this algorithm. A result of this work has been the discovery of new maximal graphs, improving the records for largest known graphs to 41 for valency 4 and diameter 3, and to 132 for valency 7 and diameter 3.

This record has no associated files available for download.

More information

Published date: 1990

Identifiers

Local EPrints ID: 461798
URI: http://eprints.soton.ac.uk/id/eprint/461798
PURE UUID: 705ef900-f031-4fa0-81f0-77107852a7eb

Catalogue record

Date deposited: 04 Jul 2022 18:55
Last modified: 04 Jul 2022 18:55

Export record

Contributors

Author: James Robert Arthur Allwright

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×