Enhanced simulated annealing for automatic reconfiguration of multiprocessors in space

Authors:
J. R. Slagle;A. Bose;P. Busalacchi;C. Wee
Affiliations:
University of Minnesota, Minneapolis, Minnesota;University of Minnesota, Minneapolis, Minnesota;University of Minnesota, Minneapolis, Minnesota;University of Minnesota, Minneapolis, Minnesota
Venue:
IEA/AIE '89 Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
Year:
1989

Citing 4
Cited 0

Parallel algorithms for chip placement by simulated annealing

IBM Journal of Research and Development
TimberWolf3.2: a new standard cell placement and global routing package

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Multiprocessor-based placement by simulated annealing

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Genetic Algorithms and Simulated Annealing

Genetic Algorithms and Simulated Annealing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes our recent results in developing enhanced simulated annealing algorithms using a LISP environment. The application is to use simulated annealing for automatic reconfiguration of multiprocessors in space. Our approach to solving this problem involves a combination of object-oriented programming, search strategies, knowledge based reasoning, and an advanced reconfiguration algorithm. The application was developed and is being enhanced on a LISP workstation (Xerox Dandelion) using LOOPS. This environment played an important role in both the initial success of the prototype [9] and the recent development efforts [3] [16] [22].