### Abstract

consuming, and thus there is interest in accelerating current algorithms by

building application specific computers. This paper focuses on accelerating

general local search meta-heuristics, such as simulated annealing and tabu

search, and presents an architecture for this class of algorithms. As a design

case study we describe a specific machine which implements a simulated

annealing based algorithm for solving the Travelling Salesman Problem

(TSP). This processor which is built with XILINX field programmable logic and APTIX interconnection matrices achieves a speedup of about 37

times over an IBM RS6000 workstation. The paper highlights the use of

reconfigurable memory as a key for obtaining high performance.

Original language | English |
---|---|

Title of host publication | Proceedings of Computer Architecture |

Publisher | Springer |

Pages | 29-43 |

Publication status | Published - 1997 |

Externally published | Yes |

### Fingerprint

### Cite this

*Proceedings of Computer Architecture*(pp. 29-43). Springer.

}

*Proceedings of Computer Architecture.*Springer, pp. 29-43.

**Application Specific Computers for Combinatorial Optimisation.** / Abramson, David; Logothetis, Paul; Postula, Adam; Randall, Marcus.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

TY - GEN

T1 - Application Specific Computers for Combinatorial Optimisation

AU - Abramson, David

AU - Logothetis, Paul

AU - Postula, Adam

AU - Randall, Marcus

PY - 1997

Y1 - 1997

N2 - Solving large combinatorial optimisation problems is often timeconsuming, and thus there is interest in accelerating current algorithms bybuilding application specific computers. This paper focuses on acceleratinggeneral local search meta-heuristics, such as simulated annealing and tabusearch, and presents an architecture for this class of algorithms. As a designcase study we describe a specific machine which implements a simulatedannealing based algorithm for solving the Travelling Salesman Problem(TSP). This processor which is built with XILINX field programmable logic and APTIX interconnection matrices achieves a speedup of about 37times over an IBM RS6000 workstation. The paper highlights the use ofreconfigurable memory as a key for obtaining high performance.

AB - Solving large combinatorial optimisation problems is often timeconsuming, and thus there is interest in accelerating current algorithms bybuilding application specific computers. This paper focuses on acceleratinggeneral local search meta-heuristics, such as simulated annealing and tabusearch, and presents an architecture for this class of algorithms. As a designcase study we describe a specific machine which implements a simulatedannealing based algorithm for solving the Travelling Salesman Problem(TSP). This processor which is built with XILINX field programmable logic and APTIX interconnection matrices achieves a speedup of about 37times over an IBM RS6000 workstation. The paper highlights the use ofreconfigurable memory as a key for obtaining high performance.

M3 - Conference contribution

SP - 29

EP - 43

BT - Proceedings of Computer Architecture

PB - Springer

ER -