Partitioning and placement for multi-FPGA systems using genetic algorithms

Conference Proceedings of the EUROMICRO

Volumn 1, Issue , 2000, Pages 204-211

  Hidalgo, José Ignacio ^a   Lanchares, Juan ^a   Hermida, Roman ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL PROBLEMS; FPGA DEVICES; FUZZY TECHNIQUES; LOGIC CAPACITY; MULTI-FPGA SYSTEM; NETLIST; ORIGINAL STRUCTURES; PLACEMENT PROBLEMS;

GRAPH THEORY; VLSI CIRCUITS;

GENETIC ALGORITHMS;

EID: 84889253700     PISSN: 10896503     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EURMIC.2000.874634     Document Type: Conference Paper

References (18)

1. C. Alpert and A. Kahng. Recent directions in netlist partitioning: A survey. Technical Report CA 90024-1596, UCLA Computer Science Department, 1997.
2. A. K. C. J. Alpert, L. W. Hagen. A hybrid multileveYgenetic approach for circuit partitioning. Technical report, UCLA Computer Science Department, 1994.
3. D. Cvetkovic and I. C. Parmee. Use of preferences for gabased multi-objective optimization. In Proceedings of the 1999 Genetic And Evolutionary Computation Conference, pages 1504-1509. Morgan Kaufmann, 1999.
4. A. Dasdan and C. Aykanat. Improved multiple-way circuit partitioning algorithms. In Proceedings ACM/SIGDA International Workshop on FPGAs, 1994.
5. C. Fiduccia and R. Matheyses. A linear time heuristic for improving network partition. In Proceedings of ACM/lEEE Design Automation Conference, pages 175-1 8 1, 1982.
6. K. H. and G. Saucier. Iterative improvement based multiway netlist partitioning for fpgas. In I. Press, editor, Proceedings of DATE 99 Conference, pages 587-594, 1999.
7. F. Harary. Graph Theory. Addison-Wesley, 1968.
8. S. Hauck. Multi-FPGA systems. PhD thesis, University of Washington, 1994.
9. S. Hauck. The roles of fpgas in re-programmable systems. Proceedings of the IEEE, 86(4):615-638, April 1998.
10. S. Hauck and G. Borriello. An evaluation of bipartitioning techniques. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 16(8):849-866, August 1997.
11. http://www. xilinx. com. Xnf Xilinx netlist format.
12. M. H u h Circuit partitioning with genetic algorithms using a coding scheme to preserve the structure of a circuit. In Lecture Notes in Computer Science, 496, pages 75-79. Springer-Verlag, 1989.
13. A. Kandel and L. Yelowitz. Fuzzy chains. IEEE Transactions on Systems Man and Cybemetics, SMC-4(5):472475, September 1994.
14. B. Kemighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Systems Tech. Joumal, 2(49):291-307,1970.
15. G. Laszewski and H. Muhlenbein. A parallel genetic algorithm for the k-way graph partitioning problem. In 1st inter: Workshop on Parallel Problem Solving from Nature, November 1990.
16. I. C. Parmee and A. H. Watson. Preliminary airframe design using co-evolutionary multi-objective genetic algorithms. In Proceedings of the 1999 Genetic And Evolutionary Computation Conference, pages 1657-1665. Morgan Kaufmann, 1999.
17. F. B. R. Kuznar and K. Kozminski. Cost minimization of partitions into multiple devices. In Proceedings of the 30th ACMLEEE Design Automation Conference, pages 3 15-320, 1993.
18. L. Sanchis. Multiple-way network partitioning. IEEE Transactions on Computers, 38(1):62-81, April 1989.