Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)
DOI: 10.1109/fpga.1998.707892
|View full text |Cite
|
Sign up to set email alerts
|

Automating production of run-time reconfigurable designs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
17
0
3

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 51 publications
(20 citation statements)
references
References 6 publications
0
17
0
3
Order By: Relevance
“…For designs with clock gating or with partial bit-streams, identical regions in successive configurations are extracted to minimise area or to minimise the reconfiguration overhead. An efficient algorithm based on weighted bipartite graphs [16] has been proposed to automate this step.…”
Section: Multiplexer-based Reconfigurationmentioning
confidence: 99%
“…For designs with clock gating or with partial bit-streams, identical regions in successive configurations are extracted to minimise area or to minimise the reconfiguration overhead. An efficient algorithm based on weighted bipartite graphs [16] has been proposed to automate this step.…”
Section: Multiplexer-based Reconfigurationmentioning
confidence: 99%
“…The absence of CAD tools that support the design flow of reconfigurable circuits and the lack of published application expertise are certainly some of the main difficulties that a designer of reconfigurable circuits must handle [Hutchings95). On the other hand several research groups have developed applications that prove the possibility (and in some cases the economic efficiency) of dynamically reconfigurable applications [Eldredge96,Wirthlin95,Robinson98,Shirazi98,Sklyarov98).…”
Section: Introductionmentioning
confidence: 99%
“…SPARCS [2] is an integrated partitioning and synthesis framework, which has a temporal partitioning tool to temporally divide and schedule the tasks on a reconfigurable system. Shirazi et al [3] proposed a methodology to take advantage of common operators in successive configurations. They attempted to reduce configuration time and thus, the application execution time.…”
Section: Introductionmentioning
confidence: 99%