Skip to main content

A Self-Reconfigurable Gate Array Architecture

  • Conference paper
  • First Online:
Book cover Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing (FPL 2000)

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

Included in the following conference series:

Abstract

This paper presents an innovative architecture for a reconfigurable device that allows single cycle context switching and single cycle random access to the unified on-chip configuration/data memory. These two features are necessary for efficient self-reconfiguration and are useful in general as well—no other device offers both features. The enhanced context switching feature permits arbitrary regions of the chip to selectively context switch—its not necessary for the whole device to do so. The memory access feature allows data transfer between logic cells and memory locations, and also directly between memory locations.

The key innovation enabling the above features is the use of a mesh of trees based interconnect with logic cells and memory blocks at the leaf nodes and identical switches at other nodes. The mesh of trees topology allows a logic cell to be associated with a pair of switches. The logic cell and the switches can be placed close to the memory block that stores their configuration bits. The physical proximity enables fast context switching while the mesh of trees topology permits fast memory access. To evaluate the architecture, a point design with 8 × 8 logic cells was synthesized using a standard cell library for a 0.25 μm process with 5 metal layers. Timing results obtained show that both context switching and memory access can be performed within a 10 ns clock cycle. Finally, this paper also illustrates how self-reconfiguration can be used to do basic routing operations of connecting two logic cells or inserting a logic cell by breaking an existing connection—algorithms (implemented as configured logic) to perform the above operations in a few clock cycles are presented.

This work was supported by the National Science Foundation, Grant CCR-9900613. Alessandro Mei was supported by MURST, “Progetto Giovani Ricercatori 1998”.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann, 1992.

    Google Scholar 

  2. S. Perissakis, Y. Joo, J. Ahn, A. De Hon, and J. Wawrzynek. Embedded dram for a reconfigurable array. In Proceedings of the 1999 Design Automation Conference, Jun. 1999.

    Google Scholar 

  3. S. M. Scalera. Personal communication, 1998.

    Google Scholar 

  4. S. M. Scalera and J. R. Vazquez. The design and implementation of a context-switching fpga. In Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines, pages 78–85, Napa, CA, April 1998.

    Google Scholar 

  5. R. P. S. Sidhu, A. Mei, and V. K. Prasanna. Genetic programming using self-reconfigurable FPGAs. In Field Programmable Logic and Applications — 9th International Workshop, FPL’99, volume 1673 of Lecture Notes in Computer Science. Springer Verlag, 1999.

    Google Scholar 

  6. R. P. S. Sidhu, A. Mei, and V. K. Prasanna. String matching on multicontext FPGAs using self-reconfiguration. In FPGA’ 99. Proceedings of the 1999 ACM/SIGDA Seventh International Symposium on Field Programmable Gate Arrays, pages 217–226, Feb. 1999.

    Google Scholar 

  7. R. P. S. Sidhu, S. Wadhwa, A. Mei, and V. K. Prasanna. A self-reconfigurable gate array architecture. In Submitted to IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

    Google Scholar 

  8. Steve Trimberger, Dean Carberry, Anders Johnson, and Jennifer Wong. A time-multiplexed FPGA. In Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines, pages 22–28, Napa, CA, April 1997.

    Google Scholar 

  9. W. Tsu, K. Macy, A. Joshi, R. Huang, N. Walker, T. Tung, O. Rowhani, V. George, J. Wawrzynek, and A. DeHon. High-speed, hierarchical synchronous reconfigurable array. In Proceedings of the International Symposium on Field Programmable Gate Arrays, pages 69–78, Feb. 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sidhu, R., Wadhwa, S., Mei, A., Prasanna, V.K. (2000). A Self-Reconfigurable Gate Array Architecture. In: Hartenstein, R.W., Grünbacher, H. (eds) Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing. FPL 2000. Lecture Notes in Computer Science, vol 1896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44614-1_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-44614-1_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67899-1

  • Online ISBN: 978-3-540-44614-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics