Abstract
The authors investigate modifications on the standard simulated annealing method for circuit placement that are intended to make it more suitable for shared-memory highly parallel computers. By permitting temporary errors and using chaotic approaches they allow the parallel algorithms to deviate from the algorithm as defined for a serial computer and obtain good execution efficiencies for large numbers of processors. They find that the qualitative behavior of the parallel algorithms is comparable to the serial algorithm.
| Original language | English |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 87-90 |
| Number of pages | 4 |
| ISBN (Print) | 0818608021 |
| State | Published - 1987 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'PARALLEL TECHNIQUES FOR CHIP PLACEMENT BY SIMULATED ANNEALING ON SHARED MEMORY SYSTEMS.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver