http://iet.metastore.ingenta.com
1887

access icon openaccess Multi-objective optimisation algorithm for routability and timing driven circuit clustering on FPGAs

Loading full text...

Full text loading...

/deliver/fulltext/iet-cdt/13/4/IET-CDT.2018.5115.html;jsessionid=1c0j4tiymb7la.x-iet-live-01?itemId=%2fcontent%2fjournals%2f10.1049%2fiet-cdt.2018.5115&mimeType=html&fmt=ahah

References

    1. 1)
      • 1. Betz, V., Rose, J.: ‘Cluster-based logic blocks for FPGAs: area-efficiency vs. input sharing and size’. Proc. of CICC 97 – Custom Integrated Circuits Conf., Santa Clara, CA, USA, 1997, pp. 551554.
    2. 2)
      • 2. Betz, V., Rose, J., Marquardt, A.R.: ‘CAD Tools: Packing and Placement’, in Betz, V., Rose, J., Marquardt, A. (Eds.) ‘Architecture and CAD for deep-submicron FPGAs’ (Kluwer Academic Publishers, Norwell, MA, USA, 1999), pp. 3761.
    3. 3)
      • 3. Singh, A., Marek-Sadowska, M.: ‘Efficient circuit clustering for area and power reduction in FPGAs’. FPGA ‘02 Proc. of the 2002 ACM/SIGDA Tenth Int. Symp. on Field-Programmable Gate Arrays, Monterey, CA, USA, 2002, pp. 5966.
    4. 4)
      • 4. Deb, K., Pratap, A., Agarwal, S., et al: ‘A fast and elitist multiobjective genetic algorithm: NSGA-II’, IEEE Trans. Evol. Comput., 2002, 6, pp. 182197.
    5. 5)
      • 5. Marquardt, A.S., Betz, V., Rose, J.: ‘Using cluster-based logic blocks and timing-driven packing to improve FPGA speed and density’. FPGA ‘99 Proc. of the 1999 ACM/SIGDA Seventh Int. Symp. on Field Programmable Gate Arrays, Monterey, CA, USA, 1999, pp. 3746.
    6. 6)
      • 6. Bozorgzadeh, E., Ogrenci-Memik, S., Sarrafzadeh, M.: ‘RPack: routability-driven packing for cluster-based FPGAs’. Proc. of the ASP-DAC 2001. Asia and South Pacific Design Automation Conf., Yokohama, Japan, 2001, pp. 629634.
    7. 7)
      • 7. Chen, D.T., Vorwerk, K., Kennings, A.: ‘Improving timing-driven FPGA packing with physical information’. Int. Conf. on Field Programmable Logic and Applications, FPL, Amsterdam, Netherlands, 2007, pp. 117123.
    8. 8)
      • 8. Rajavel, S.T., Akoglu, A.: ‘MO-Pack: many-objective clustering for FPGA CAD’. Proc. of the 48th Design Automation Conf., San Diego, CA, USA, 2011, pp. 818823.
    9. 9)
      • 9. Marquardt, A.R.: ‘Cluster-based architecture, timing-driven packing and timing-driven placement for FPGAs’ (ACM New York, NY, USA, 1999).
    10. 10)
      • 10. Kuon, I., Tessier, R., Rose, J.: ‘FPGA architecture: survey and challenges’, Found. Trends Electron. Des. Autom., 2007, 2, (2), pp. 135253.
    11. 11)
      • 11. Feng, W., Kaptanoglu, S.: ‘Designing efficient input interconnect blocks for LUT clusters using counting and entropy’, ACM Trans. Reconfigur. Technol. Syst., 2008, 1, (1), pp. 6:16:28. Available at http://doi.acm.org/10.1145/1331897.1331902.
    12. 12)
      • 12. Lewis, D.: ‘The stratixTM logic and routing architecture’. Proc. of the 2003 ACM/SIGDA Eleventh Int. Symp. on Field Programmable Gate Arrays, Monterey, CA, USA, 2003, pp. 1220.
    13. 13)
      • 13. Leventis, P., Chan, M., Chan, M., et al: ‘Cyclone: a low-cost, high-performance FPGA’. Proc. of the IEEE 2003 CICC, San Jose, CA, USA, 2003, pp. 4952.
    14. 14)
      • 14. Feng, W.: ‘K-way partitioning based packing for FPGA logic blocks without input bandwidth constraint’. 2012 Int. Conf. Field-Programmable Technology (FPT), Seoul, Republic of Korea, 2012, pp. 815.
    15. 15)
      • 15. Betz, V., Rose, J.: ‘VPR: a new packing placement and routing tool for FPGA research’. Int. Workshop on Int. Workshop on Field-Programmable Logic and Application, London, UK, 1997, pp. 213222.
    16. 16)
      • 16. Rose, J., Brown, S.: ‘Flexibility of interconnection structures for field-programmable gate arrays’, IEEE J. Solid-State Circuits, 1991, 26, (3), pp. 277282.
    17. 17)
      • 17. Fukunaga, A.S., Korf, R.E.: ‘Bin completion algorithms for multicontainer packing, knapsack, and covering problems’, J. Artif. Intell. Res., 2007, 28, pp. 393429.
    18. 18)
      • 18. Bozorgzadeh, E., Memik, S.O., Yang, X., et al: ‘Routability-driven packing: metrics and algorithms for cluster-based FPGAs’, J. Circuits Syst. Comput., 2004, 13, pp. 77100.
    19. 19)
      • 19. Karypis, G., Kumar, V.: ‘Multilevel K-way hypergraph partitioning’. DAC ‘99 Proc. of the 36th Annual ACM/IEEE Design Automation Conf., New Orleans, LA, USA, 1999, pp. 343348.
    20. 20)
      • 20. Marrakchi, Z., Mrabet, H., Mehrez, H.: ‘Hierarchical FPGA clustering based on a multilevel partitioning approach to improve routability and reduce power dissipation’, ReConFig'05, Puebla City, Mexico, 2005, p. 25.
    21. 21)
      • 21. Tom, M., Leong, D., Lemieux, G.: ‘Un/DoPack: re-clustering of large system-on-chip designs with interconnect variation for low-cost FPGAs’. IEEE/ACM Int. Conf. on Computer-Aided Design, ICCAD'06, San Jose, CA, USA, 2006, pp. 680687.
    22. 22)
      • 22. Liu, H., Akoglu, A.: ‘T-NDPack: timing-driven non-uniform depopulation based clustering’. 5th Southern Conf. on Programmable Logic, SPL, Sao Carlos, Brazil, 2009, pp. 914.
    23. 23)
      • 23. Bäck, T., Hammel, U., Schwefel, H.P.: ‘Evolutionary computation: comments on the history and current state’, IEEE Trans. Evol. Comput., 1997, 1, (1), pp. 317.
    24. 24)
      • 24. Eiben, A.E., Smith, J.E.: ‘Introduction to evolutionary computing’, Natural Computing Series (Springer Berlin Heidelberg, Berlin, Germany, 2007). Available at https://books.google.co.uk/books?id=RRKo9xVFW\_QC.
    25. 25)
      • 25. Holland, J.H.: ‘Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence’ (MIT Press, Cambridge, MA, USA, 1992).
    26. 26)
      • 26. Horn, J., Nafploitis, N., Goldberg, D.E.: ‘A niched Pareto genetic algorithm for multiobjective optimization’. Proc. of the First IEEE Conf. on Evolutionary Computation, Orlando, FL, USA, 1994, pp. 8287.
    27. 27)
      • 27. Srinivas, N., Deb, K.: ‘Multiobjective function optimization using nondominated sorting genetic algorithms’, Evol. Comput., 1995, 2, pp. 221248.
    28. 28)
      • 28. Wang, Y., Bale, S.J., Walker, J.A., et al: ‘Multiobjective genetic algorithm for routability-driven circuit clustering on FPGAs’. 2014 IEEE Int. Conf. on Evolvable Systems, Orlando, FL, USA, 2014, pp. 109116.
    29. 29)
      • 29. Landman, B.S., Russo, R.L.: ‘On a pin versus block relationship for partitions of logic graphs’, IEEE Trans. Comput., 1971, C-20, pp. 14691479.
    30. 30)
      • 30. Deb, K., Pratap, A., Meyarivan, T.: ‘Constrained test problems for multi-objective evolutionary optimization’. Evolutionary Multi-Criterion Optimization, Zurich, Switzerland, 2001, pp. 284298.
    31. 31)
      • 31. Deb, K., Pratap, A., Moitra, S.: ‘Mechanical component design for multiple objectives using elitist non-dominated sorting GA’. Proc. of the Parallel Problem solving from Nature VI Conf., Paris, France, 2000, pp. 859868.
    32. 32)
      • 32. Falkenauer, E.: ‘A new representation and operators for genetic algorithms applied to grouping problems’, Evol. Comput., 1994, 2, (2), pp. 123144.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cdt.2018.5115
Loading

Related content

content/journals/10.1049/iet-cdt.2018.5115
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address