Article

Free access

Circuit partitioning for dynamically reconfigurable FPGAs

Authors:

Huiqun Liu,

D. F. WongAuthors Info & Claims

FPGA '99: Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays

Pages 187 - 194

https://doi.org/10.1145/296399.296456

Published: 01 February 1999 Publication History

PDF eReader

References

[1]

Steve Trimberger, "Scheduling Designs into a Time- Multiplexed FPGA", International Symposium on Field Programmable Gate Arrays, Feb, 1998.

Digital Library

Google Scholar

[2]

Douglas Chang and Malgorzata Marek-Sadowska, "Partitioning Sequential Circuits on dynamically Reconfigurable FPGAs", International Symposium on Field Programmable Gate Arrays, Feb, 1998.

Digital Library

Google Scholar

[3]

Douglas Chang and Malgorzata Marek-Sadowska, "Buffer Minimization and Time-multiplexed I/O on Dynamically Reconfigurable FPGAs", International Symposium on Field Programmable Gate Arrays, Feb., t997.

Digital Library

Google Scholar

[4]

Sasan Iman, Massoud Pedram, Charles Fabian and Jason Cong, "Finding Uni-Directional Cuts Based on Physical Partitioning and Logic Restructuring", dth International workshop on physical design, 1993.

Google Scholar

[5]

J.R. Ford and D.R. Fulkerson, "Flows in Networks", Princeton University Press, 1962.

Google Scholar

[6]

N.B. Bhat, K. Chaudhary and E.S. Kuh, "Performanceoriented fully routable dynamic architecture for a field programmable logic device", Memorandum No. UCB/ERL M93/42, university of California, Berkeley, 1993.

Digital Library

Google Scholar

[7]

jeremy Brown, Derrick Chen, et al. "DELTA: Prototype for a first- generation dynamically programmable gate array", Transit Note 112, MIT, 1995.

Google Scholar

[8]

Andre DeHon, "DPGA-coupled microprocessors: Commodity ICs for the early 21st century", In IEEE Workshop on FPGAs for Custom Computing Machines, 1994.

Crossref

Google Scholar

[9]

D. jones and D.M. Lewis, "A time-multiplexed FPGA architecture for logic emulation", In IEEE Custom Integrated Circuits Conference, 1995.

Google Scholar

[10]

R. S. Tsay, E. S. Kuh and C. P. Hsu, "Proud: A seaof-gates placement algorithm.", in Proceedings of the iEEE International Conference on Computer Aided Design, pp318-323, Nov. 1988.

Digital Library

Google Scholar

[11]

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, W. H. Freeman and Company, 1979.

Digital Library

Google Scholar

[12]

C. M. Fiduccia and R. M. Mattheyses, "A linear-time heuristic for improving network partitions", In Proceedings of the 19th Design Automation Conferences, pp 175-181, June 1982.

Digital Library

Google Scholar

[13]

B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs", IEEE Transaction on Computers, pp1064-1068, Nov. 1978.

Google Scholar

[14]

Honghua Yang and D. F. Wong, "Efficient Network Flow Based Min-Cut Balanced Partitioning", Proc. IC- CAD, 1994.

Digital Library

Google Scholar

[15]

Xilinx, The Programmable Logic Data Book, 1996.

Google Scholar

[16]

Huiqun Liu and D. F. Wong, "Network flow based circuit partitioning for time-multiplexed FPGAs", International Conference on Computer Aided Design, San Jose, CA, Nov. 1998.

Digital Library

Google Scholar

Cited By

View all

Mehta DShetters CBouldin D(2013)Meta-algorithms for scheduling a chain of coarse-grained tasks on an array of reconfigurable FPGAsVLSI Design10.1155/2013/2495922013(3-3)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1155/2013/249592
Feilen MIliopoulos AVonbun MStechele W(2013)Weighted partitioning of sequential processing chains for dynamically reconfigurable FPGAS2013 23rd International Conference on Field programmable Logic and Applications10.1109/FPL.2013.6645521(1-8)Online publication date: Sep-2013
https://doi.org/10.1109/FPL.2013.6645521
Greengard S(2011)Social games, virtual goodsCommunications of the ACM10.1145/1924421.192442954:4(19-22)Online publication date: 1-Apr-2011
https://dl.acm.org/doi/10.1145/1924421.1924429
Show More Cited By

Index Terms

Circuit partitioning for dynamically reconfigurable FPGAs
1. Hardware

Recommendations

Pipeline Reconfigurable DSP for Dynamically Reconfigurable Architectures

Dynamically reconfigurable architectures, such as NATURE, achieve high logic density and low reconfiguration latency compared to traditional field-programmable gate arrays. Unlike fine-grained NATURE, reconfigurable DSP block incorporated NATURE ...
Hardware/software partitioning and pipelined scheduling on runtime reconfigurable FPGAs

FPGAs are widely used in today's embedded systems design due to their low cost, high performance, and reconfigurability. Partially RunTime-Reconfigurable (PRTR) FPGAs, such as Virtex-2 Pro and Virtex-4 from Xilinx, allow part of the FPGA area to be ...
Partitioning Sequential Circuits on Dynamically Reconfigurable FPGAs

A fundamental feature of Dynamically Reconfigurable FPGAs (DRFPGAs) is that the logic and interconnect are time-multiplexed. Thus, for a circuit to be implemented on a DRFPGA, it needs to be partitioned such that each subcircuit can be executed at a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

FPGA '99: Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays

February 1999

257 pages

ISBN:1581130880

DOI:10.1145/296399

Chairmen:
Sinan Kaptanoglu
Actel Corporation
,
Steve Trimberger
Xilinx

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

FPGA99

Sponsor:

SIGDA

FPGA99: ACM/SIGDA Symposium on Field Programmable Gate Arrays

February 21 - 23, 1999

California, Monterey, USA

Acceptance Rates

Overall Acceptance Rate 125 of 627 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
744
Total Downloads

Downloads (Last 12 months)52
Downloads (Last 6 weeks)3

Reflects downloads up to 18 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mehta DShetters CBouldin D(2013)Meta-algorithms for scheduling a chain of coarse-grained tasks on an array of reconfigurable FPGAsVLSI Design10.1155/2013/2495922013(3-3)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1155/2013/249592
Feilen MIliopoulos AVonbun MStechele W(2013)Weighted partitioning of sequential processing chains for dynamically reconfigurable FPGAS2013 23rd International Conference on Field programmable Logic and Applications10.1109/FPL.2013.6645521(1-8)Online publication date: Sep-2013
https://doi.org/10.1109/FPL.2013.6645521
Greengard S(2011)Social games, virtual goodsCommunications of the ACM10.1145/1924421.192442954:4(19-22)Online publication date: 1-Apr-2011
https://dl.acm.org/doi/10.1145/1924421.1924429
Ponpandi STyagi A(2011)Partial reconfiguration logic synthesis by temporal slicing2011 International Conference on Field-Programmable Technology10.1109/FPT.2011.6132720(1-6)Online publication date: Dec-2011
https://doi.org/10.1109/FPT.2011.6132720
Li P(2010)What is parallel circuit simulation?ACM SIGDA Newsletter10.1145/1866963.186696440:4(1-1)Online publication date: 1-Apr-2010
https://dl.acm.org/doi/10.1145/1866963.1866964
Vu LGupta INahrstedt KLiang J(2010)Understanding overlay characteristics of a large-scale peer-to-peer IPTV systemACM Transactions on Multimedia Computing, Communications, and Applications10.1145/1865106.18651156:4(1-24)Online publication date: 26-Nov-2010
https://dl.acm.org/doi/10.1145/1865106.1865115
Marshall DMcloone SWard T(2010)Optimizing consistency by maximizing bandwidth usage in distributed interactive applicationsACM Transactions on Multimedia Computing, Communications, and Applications10.1145/1865106.18651146:4(1-23)Online publication date: 26-Nov-2010
https://dl.acm.org/doi/10.1145/1865106.1865114
Fung BWang KChen RYu P(2010)Privacy-preserving data publishingACM Computing Surveys10.1145/1749603.174960542:4(1-53)Online publication date: 23-Jun-2010
https://dl.acm.org/doi/10.1145/1749603.1749605
Cardoso JDiniz PWeinhardt M(2010)Compiling for reconfigurable computingACM Computing Surveys10.1145/1749603.174960442:4(1-65)Online publication date: 23-Jun-2010
https://dl.acm.org/doi/10.1145/1749603.1749604
Mukherjee RLiu SMemik SMondal S(2008)A high-level clustering algorithm targeting dual Vdd FPGAsACM Transactions on Design Automation of Electronic Systems10.1145/1391962.139196513:4(1-20)Online publication date: 3-Oct-2008
https://dl.acm.org/doi/10.1145/1391962.1391965
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Pipeline Reconfigurable DSP for Dynamically Reconfigurable Architectures

Hardware/software partitioning and pipelined scheduling on runtime reconfigurable FPGAs

Partitioning Sequential Circuits on Dynamically Reconfigurable FPGAs