Skip to main content
SpringerLink
Log in
Book cover

Three-Dimensional Design Methodologies for Tree-based FPGA Architecture pp 73–94Cite as

Two Dimensional FPGAs: Configuration and CAD Flow

  • Chapter
  • First Online:

  • 1412 Accesses

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 350))

Abstract

FPGA architectures have been intensely investigated over the past two decades. A major aspect of FPGA architecture research is the development of Computer Aided Design (CAD) tools for design and implementation of fast and high density FPGAs and mapping applications to it. It is well established that the quality of an FPGA based implementation is largely determined by the effectiveness of accompanying suite of CAD tools. Benefits of an otherwise well designed, feature rich FPGA architecture might be impaired if the CAD tools cannot take advantage of the features that the modern FPGA design provides. Thus, CAD algorithm research is essential to the necessary architectural advancement to narrow down the performance gaps between FPGAs and other computational devices like ASICs. This chapter discuss different algorithms and methodologies used to create 2D FPGA placement, routing, mapping application etc.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. E.M. Sentovich, K.J. Singh, L. Lavango, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. Stephan, R.K. Brayton, A. Sangiovanni-Vincentelli, SIS: A System for Sequential Circuit Synthesis, Technical Report No. UCB/ERL, M92/41. (University of California Berkeley, 1992)

    Google Scholar 

  2. J. Cong, Y. Ding, FlowMap: An optimal technology mapping algorithm for delay optimization in look-up-table based fpga designs. IEEE Trans. Comput. Aided Des, 1–12 (1994)

    Google Scholar 

  3. J. Cong, Y. Ding, On area/depth trade-off in LUT-based FPGA technology mapping. IEEE Trans. VLSI Syst. 2(2), 137–148 (1994)

    Article  Google Scholar 

  4. J. Cong, Y. Hwang, Simultaneous depth and area minimization in LUT-based FPGA mapping, in ACM/SIGDA International Symposim on FPGAs, pp. 68–74 (1995)

    Google Scholar 

  5. J. Cong, Y. Ding, Structural gate decomposition for depth-optimal technology in LUT-based FPGA designs. ACM Trans. Des. Autom. Electr. Syst. 5(3) (2000)

    Google Scholar 

  6. D. Huang, A. Kahng, When clusters meet partitions: new density based methods for circuit decomposition, in IEEE European Design and Test Conference, pp. 60–64 (1995)

    Google Scholar 

  7. L. Hagen, A. Kahng, Combining problem reduction and adaptive multi-start: a new technique for superior iterative partitioning, in IEEE Transactions on Computer-Aided Design, pp. 92–98 (1997)

    Google Scholar 

  8. R. Murgai, R. Brayton, A. Sangiovanni-Vincentelli, On clustering for minimum delay/area, in IEEE International Conference on Computer Aided Design, pp. 6–9 (1991)

    Google Scholar 

  9. M. Dehkordi, S. Brown, The effect of cluster packing and node duplication control in delay driven clustering, in IEEE International Conference on Field Programmable Technology, pp. 227–233 (2002)

    Google Scholar 

  10. A. Marquart, V. Betz, J. Rose, Using cluster-based logic block and timing-driven packing to improve fpga speed and density, in ACM International Symposium on FPGA, Monterey, pp. 37–46 (1999)

    Google Scholar 

  11. A. Singh, M. Marek-Sadowska, Efficient circuit clustering for area and power reduction in FPGAs, in International Symposium on Field Programmable Gate Arrays, pp. 59–66 (2002)

    Google Scholar 

  12. E. Bozorgzadeh et al., Routability-driven packing: Metrics and algorithms for cluster-based FPGAs. IEEE J. Circuits Syst. Comput. 13(1), 77–100 (2004)

    Google Scholar 

  13. V. Betz, J. Rose, A, Marquardt Architecture and CAD for Deep Sub-micron FPGAs. (Kluwer, Norwell, MA, 1999)

    Google Scholar 

  14. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP complete problems, in Sixth Annual ACM Symposium on Theory of Computing, pp. 47–63 (1974)

    Google Scholar 

  15. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, an Francisco (Freeman, CA, 1979)

    Google Scholar 

  16. B. Kernighan, S. Lin, An efficient heuristic procedure for partitioning graph. Bell Syst. Technol. J. 49, 299–307 (1970)

    Article  Google Scholar 

  17. C.M. Fiduccia, R.M. Mattheyeses, A liner-time heuristic for improving network partitions, in Design Automation Conference, vol. 7, pp. 175–181 (1982)

    Google Scholar 

  18. T. Bui, S. Chaudhuri, T. Leighton, M. Sipser, Graph bisection algorithms with good average behavior. Combinatorica (1987)

    Google Scholar 

  19. D.A. Papa, I.L. Markov, Hypergraph Partitioning and Clustering, Technical Report. (University of Michigan, EECS Department, 2007)

    Google Scholar 

  20. G. Karypis, R. Aggarwal, V. Kumar, S. Shekhar, Multilevel hypergraph partitioning: application in VLSI design, in ACM, Design Automation Conference, pp. 526–529 (1997)

    Google Scholar 

  21. G. Karypis, V. Kumar, Multilevel k-way hypergraph partitioning, in Proceedings of the 36th annual ACM/IEEE Design Automation Conference, pp. 343–348 (1999)

    Google Scholar 

  22. A. Dunlop, B. Kernighan, A procedure for placement of standard-cell VLSI circuits. IEEE Trans. CAD, 92–98 (1985)

    Google Scholar 

  23. D. Huang, A. Kahng, Partitioning-based standard-cell global placement with an exact objective, in ACM Symposium on Physical Design, pp. 18–25 (1997)

    Google Scholar 

  24. G. Sigl, K. Doll, F. Johannes, Analytical placement: a linear or a quadratic objective function?, in ACM Design Automation Conference, pp. 427–432 (1991)

    Google Scholar 

  25. C. Alpert, T. Chan D. Huang A. Kahng I. Markov P. Mulet, K. Yan, Faster Minimization of linear wire-length for global placement, in ACM Symposium on Physical Design, pp. 4–11 (1997)

    Google Scholar 

  26. S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  27. C. Sechen, A. Sangiovanni-Vincentelli, The Timberwolf Placement and Routing Package. (JSSC, 1985) pp. 510–522

    Google Scholar 

  28. M. Huang, F. Romeo, A. Sangiovanni-Vincentelli, An efficient general cooling schedule for simulated annealing, in Proceedings of ICCAD, pp. 381–384 (1986)

    Google Scholar 

  29. Y. Sanker, J. Rose, Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs. ACM International Symposium on FPGAs, FPGA (1999)

    Google Scholar 

  30. P. Du, G. W. Grewal, S. Areibi, D.K. Banerji, A fast hierarchical approach to FPGA placement, in ESA/VLSI, pp. 497–503 (2004)

    Google Scholar 

  31. L. McMurchie, C. Ebeling, PathFinder: a negotiation based performance driven router for FPGAs, in Conference of Field Programmable Gate Arrays FPGA, vol. 12, no 2, pp. 291–301 (1995)

    Google Scholar 

  32. T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms. (MIT Press, Cambridge, 1990)

    Google Scholar 

  33. D. Lewis et al., The stratix logic and routing architecture, in International Symposium on Field Programmable Gate Arrays, FPGA-2003, pp. 12–20, Feb 2003

    Google Scholar 

  34. N. Selvakkumaran, G. Karypis, Multi-objective hypergraph-partitioning algorithm for cut and maximum subdomain-degree minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits 25(3), 504–517 (2006)

    Article  Google Scholar 

  35. Z. Marrakchi, H. Mrabet, H. Mehrez, Hierarchical FPGA clustering to improve routability, in Ph.D. Research Conference in Microelectronics, PRIME (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical and Computer Engineering Department, School of Engineering, American University in Dubai, Dubai, United Arab Emirates

    Vinod Pangracious

  2. Flexras Technologies, Biocitech, Romainville, France

    Zied Marrakchi

  3. University of Pierre and Marie Curie, Paris VI, Paris, France

    Habib Mehrez

Authors
  1. Vinod Pangracious
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zied Marrakchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Habib Mehrez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vinod Pangracious .

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Pangracious, V., Marrakchi, Z., Mehrez, H. (2015). Two Dimensional FPGAs: Configuration and CAD Flow. In: Three-Dimensional Design Methodologies for Tree-based FPGA Architecture. Lecture Notes in Electrical Engineering, vol 350. Springer, Cham. https://doi.org/10.1007/978-3-319-19174-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19174-4_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19173-7

  • Online ISBN: 978-3-319-19174-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation