Skip to main content

Analysis of a Hybrid Interconnect Architecture for Dynamically Reconfigurable FPGAs

  • Conference paper
Field Programmable Logic and Application (FPL 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3203))

Included in the following conference series:

Abstract

Dynamically reconfigurable devices allow run-time reconfiguration to permit execution of incoming tasks or task fragments. One of the important issues in run-time reconfiguration is the fragmentation of the device area as the reconfigurable blocks are allocated and released when tasks are placed, executed and deleted. Due to those scattered, unused resources, an incoming application may not be placeable or routable. A cluster-based reconfigurable FPGA architecture is proposed to alleviate this difficulty. We present an assessment of the proposed architecture. We develop a fast evaluation tool to simulate on-line placement and routing effects on a run-time reconfigurable platform. The simulation results show the efficiency of the proposed architecture in relieving the fragmentation problem at the price of a modest increase in the number of switches.

This work is sponsored in part by the Dayton Area Graduate Studies Institute (DAGSI) and the Air Force Research Laboratory (AFRL) research program under contract number IF-UC-00-07.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brown, S., Francis, R., Rose, J., Vranesic, Z.: Field-programmable gate arrays. Kluwer Academic Publishers, Dordrecht (1992)

    MATH  Google Scholar 

  2. Leighton, F.: Introduction to parallel algorithms and architectures: array, trees, hypercubes. Morgan Kaufmann Publishers Inc., San Francisco (1992)

    Google Scholar 

  3. Lai, Y., Wang, P.: Hierarchical interconnection structures for field programmable gate arrays. IEEE Trans. on VLSI. 5(2), 186–196 (1997)

    Article  Google Scholar 

  4. Rubin, R., DeHon, A.: Design of FPGA interconnect for multilevel metalization. In: 11th international symposium on FPGAs, pp. 154–163 (2003)

    Google Scholar 

  5. Walder, H., Steiger, C., Platzner, M.: Fast online task placement on FPGAs: free space partitioning and 2D-hashing. In: IPDPS 2003 (2003)

    Google Scholar 

  6. Manish, H., Vemuri, R.: an efficient algorithm for finding empty space for online placement. DAC (2004)

    Google Scholar 

  7. Xilinx, Inc.: Virtex-II Pro platform FPGA handbook (January 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, R., Handa, M., Vemuri, R. (2004). Analysis of a Hybrid Interconnect Architecture for Dynamically Reconfigurable FPGAs. In: Becker, J., Platzner, M., Vernalde, S. (eds) Field Programmable Logic and Application. FPL 2004. Lecture Notes in Computer Science, vol 3203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30117-2_96

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30117-2_96

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22989-6

  • Online ISBN: 978-3-540-30117-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics