A Very High Speed Architecture for Simulated Annealing

Authors:
David Abramson
Affiliations:
Commonwealth Scientific and Industrial Research Organization, Carlton, Vic., Australia
Venue:
Computer
Year:
1992

Citing 5
Cited 9

Parallel implementations of the statistical cooling algorithm

Integration, the VLSI Journal
A parallel statistical cooling algorithm

3rd annual symposium on theoretical aspects of computer science on STACS 86
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Constructing school timetables using simulated annealing: sequential and parallel algorithms

Management Science
A placement algorithm for array processors

DAC '83 Proceedings of the 20th Design Automation Conference

A Connectionist Approach for Solving Large ConstraintSatisfaction Problems

Applied Intelligence
A Taxonomy of Hybrid Metaheuristics

Journal of Heuristics
A Survey of Automated Timetabling

Artificial Intelligence Review
A Boolean Neural Network Approach for the Traveling Salesman Problem

IEEE Transactions on Computers
Hardware Support for Simulated Annealing and Tabu Search

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Using PVM for Distributed Logic Minimization in a Network of Computers

Proceedings of the 6th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling

Journal of Scheduling
Simulated annealing techniques

Algorithms and theory of computation handbook
Improving FPGA placement with dynamically adaptive stochastic tunneling

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	4.10

Visualization

Abstract

A class of scheduling problems that can be modeled by using very simple cost measures, namely, counting costs and distance-measure costs, is presented. These measures can be incorporated into a simulated annealing algorithm, providing a robust system for solving such scheduling problems. A special-purpose computer architecture that supports the simulated annealing of such problems is described. This architecture provides speeds greatly surpassing those of conventional workstations and supercomputers using the same algorithm.