The Partition into Hypercontexts Problem for Hyperreconfigurable Architectures

S. Lange, M. Middendorf · International Conference on Field-Programmable Logic and Applications · 2004

Summary

It is shown that the general problem is NP-hard but fast polynomial time algorithms are given to solve this problem on different types of hyperreconfigurable architectures, including newly introduced architectures that use a cache to store hypercontexts.

Published: 2004-08-30
Cited by: 6
References: 18
Access: Open access
DOI: https://doi.org/10.1007/978-3-540-30117-2_27
Semantic Scholar: https://api.semanticscholar.org/CorpusID:18427440

References

Unifying FPGAs and SIMD ArraysMichael Bolotski Andr, DeHon Thomas, F. K. Knight — 1994
Compile-time Optimization of Dynamic Hardware ReconfigurationsJürgen Teich, Sándor P. Fekete, Jörg Schepers — 1999
Hyperreconfigurable architectures for fast run time reconfigurationJ. S. Lange, Martin Middendorf — 2004
Multi task hyperreconfigurable architectures: models and reconfiguration problemsSebastian Lange, Martin Middendorf — 2005
Incremental reconfiguration of multi-FPGA systemsK. K. Lee, Martin D. F. Wong — 2002
Configuration compression for FPGA-based embedded systemsAndreas Dandalis, Viktor K. Prasanna — 2001
Reconfigurable computing: Architectures, mod- els and algorithmsKiran Bondalapati, Viktor K. Prasanna — 2000
Models and reconfiguration problems for multi task hyperreconfigurable architecturesJ. S. Lange, Martin Middendorf — 2004
Reconfigurable computing: a survey of systems and softwareKatherine Compton, Scott Hauck — 2002
WASMII: a data driven computer on a virtual hardwareXiaoning Ling, H. Amano — 1993
Configuration compression for the Xilinx XC6200 FPGAScott Hauck, Zhiyuan Li, Eric J. Schwabe — 1998
System design for flexibilityChristian Haubelt, Jürgen Teich, Kai Richter — 2002
On metrics for comparing routability estimation methods for FPGAsParivallal Kannan, Shankar Balachandran, Dinesh Bhatia — 2002
Context Switching in a Run-Time Reconfigurable SystemKiran Puttegowda, David I. Lehn, Jae H. Park — 2003
(Self-)reconfigurable finite state machines: theory and implementationMarkus de Koster, J. Teich — 2002
Dynamic runtime re-scheduling allowing multiple implementations of a task for platform-based designsTin-man Lee, Jörg Henkel, Wayne Wolf — 2002
A Self-Reconfigurable Gate Array ArchitectureReetinder P. S. Sidhu, Sameer Wadhwa, Alessandro Mei — 2000
Efficient Self-Reconfigurable Implementations Using On-chip MemorySameer Wadhwa, Andreas Dandalis — 2000

Cited by

Cache Architectures for Reconfigurable HardwareSebastian Lange, Martin Middendorf — 2006
Analyse und Entwurf von Methoden zur Ressourcenverwaltung partiell rekonfigurierbarer ArchitekturenMarkus Köster — 2007
Models and reconfiguration problems for multi task hyperreconfigurable architecturesJ. S. Lange, Martin Middendorf — 2004
Heuristics for context-caches in 2-level reconfigurable architecturesJ. S. Lange, Martin Middendorf — 2005
Optimization of reconfiguration overhead by algorithmic transformations and hardware matchingMarkus Rullmann, Sebastian Siegel, Renate Merker — 2005
Models and Algorithms for Hyperreconfigurable HardwareS. Lange, M. Middendorf — 2010

Related papers

No related papers recorded.