- AutorIn
- Sebastian Lange
- Martin Middendorf
- Titel
- The Partition into Hypercontexts Problem for Hyperreconfigurable Architectures
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:15-qucosa2-328449
- Quellenangabe
- Field Programmable Logic and Application : 14th International Conference, FPL 2004, Leuven, Belgium, August 30-September 1, 2004. Proceedings
Erscheinungsort: Berlin [u.a.]
Verlag: Springer
Erscheinungsjahr: 2004
Titel Schriftenreihe: Lecture Notes in Computer Science book series
Bandnummer Schriftenreihe: 3202
Seiten: 251-260
ISBN: 978-3-540-22989-6 - Erstveröffentlichung
- 2004
- Abstract (EN)
- Hyperreconfigurable architectures adapt their reconfiguration abilities during run time in order to achieve fast dynamic reconfiguration. Models for such architectures have been proposed that change their ability for reconfiguration during hyperreconfiguration steps and in ordinary reconfiguration steps reconfigure the actual contexts for a computation within the limits that have been set by the last hyperreconfiguration step. In this paper we study algorithmic aspects of how to optimally decide what hyperreconfiguration steps should be done during a computation in order to minimize the total time necessary for hyperreconfiguration and ordinary reconfiguration. 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. These include newly introduced architectures that use a cache to store hypercontexts. We define an example hyperreconfigurable architecture and illustrate the introduced concepts for three application problems.
- Freie Schlagwörter (DE)
- Informatics, Computer science
- Klassifikation (DDC)
- 004
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:15-qucosa2-328449
- Veröffentlichungsdatum Qucosa
- 29.01.2019
- Dokumenttyp
- Konferenzbeitrag
- Sprache des Dokumentes
- Englisch