Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors
Authors:
- P. BanerjeePBP. Banerjee
- M.H. JonesMJM.H. Jones
- J.S. SargentJSJ.S. Sargent
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 1 (1) , 91-106
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Almost all k-colorable graphs are easy to colorJournal of Algorithms, 1988
- Parallel standard cell placement algorithms with quality equivalent to simulated annealingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- A Parallel Simulated Annealing Algorithm for the Placement of Macro-CellsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Placement by Simulated Annealing on a MultiprocessorIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Parallel implementations of the statistical cooling algorithmIntegration, 1986
- Simulated Annealing Without Rejected MovesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- A tutorial survey of theory and applications of simulated annealing1985
- The cosmic cubeCommunications of the ACM, 1985
- Optimization by Simulated AnnealingScience, 1983
- New methods to color the vertices of a graphCommunications of the ACM, 1979