- AutorIn
- Sebastian Lange
- Martin Middendorf
- Titel
- Hyperreconfigurable architectures and the partition into hypercontexts problem
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:15-qucosa2-328458
- Quellenangabe
- Journal of Parallel and Distributed Computing Verlag: Elsevier
Erscheinungsjahr: 2005
Jahrgang: 65
Heft: 6
Seiten: 743-754
ISSN: 0743-7315 - Erstveröffentlichung
- 2005
- Abstract (EN)
- Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increasing flexibility of modern dynamically reconfigurable systems improves their adaptability to computational needs but also makes fast reconfiguration difficult because of the large amount of reconfiguration information which has to be transferred. However, even when a computation uses this flexibility it will not use it all the time. Therefore, we propose to make the potential for reconfiguration itself reconfigurable. Such architectures are called hyperreconfigurable. Different models of hyperreconfigurable architectures are proposed in this paper. We also study a fundamental problem that emerges on such architectures, namely, to determine for a given computation when and how the potential for reconfiguration should be changed during run time so that the reconfiguration overhead is minimal. It is shown that the general problem is NP-hard but fast polynomial time algorithms are given to solve this problem for special types of hyperreconfigurable architectures. We define two example hyperreconfigurable architectures and illustrate the introduced concepts for corresponding application problems.
- Freie Schlagwörter (EN)
- Informatics, Computer science
- Klassifikation (DDC)
- 004
- Version / Begutachtungsstatus
- publizierte Version / Verlagsversion
- URN Qucosa
- urn:nbn:de:bsz:15-qucosa2-328458
- Veröffentlichungsdatum Qucosa
- 29.01.2019
- Dokumenttyp
- Artikel
- Sprache des Dokumentes
- Englisch