Parallel simulated annealing: accuracy vs. speed in placement
暂无分享,去创建一个
[1] Rob A. Rutenbar,et al. FLOORPLANNING BY ANNEALING ON A HYPERCUBE MULTIPROCESSOR. , 1987 .
[2] Mark Jones,et al. Performance of a Parallel Algorithm for Standard Cell Placement on the Intel Hypercube , 1987, 24th ACM/IEEE Design Automation Conference.
[3] Prithviraj Banerjee,et al. An improved simulated annealing algorithm for standard cell placement , 1988 .
[4] Rob A. Rutenbar,et al. Placement by Simulated Annealing on a Multiprocessor , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[5] Mark Howard Jones,et al. A parallel simulated annealing algorithm for standard cell placement on a hypercube computer , 1987 .
[6] Charles L. Seitz,et al. The cosmic cube , 1985, CACM.
[7] Alberto L. Sangiovanni-Vincentelli,et al. A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[8] A. Sangiovanni-Vincentelli,et al. The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.
[9] Frederica Darema,et al. Multipurpose Parallelism for VLSI Cad on the RP3 , 1987, IEEE Design & Test of Computers.
[10] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[11] Jonathan Rose,et al. Parallel standard cell placement algorithms with quality equivalent to simulated annealing , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[12] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..