Boppu S, Hannig F, Teich J, Pérez-Andrade R (2011)
Publication Type: Conference contribution
Publication year: 2011
Publisher: IEEE Press
Edited Volumes: Proceedings - 2011 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2011
City/Town: New York, NY, USA
Pages Range: 392-397
Conference Proceedings Title: Proc. of ReConFig
ISBN: 978-1-4577-1734-5
URI: http://www.computer.org/portal/web/csdl/doi/10.1109/ReConFig.2011.91
Invasive computing is a novel computing paradigm, which allows us to allocate several resources at run-time. Tightly-coupled processor arrays are well suited for invasive computing. This paper proposes a methodology, to symbolically program a claimed array of computational resources. Using this methodology, a single configuration stream can be derived, which is sufficient to configure all the claimed resources (processing elements) irrespective of the number of resources claimed. The configuration stream is modified at run-time dynamically, depending on the number of processors claimed. Configuration memory requirements were estimated for our methodology. It requires constant memory size and is independent of the problem size compared to a traditional approach. © 2011 IEEE.
APA:
Boppu, S., Hannig, F., Teich, J., & Pérez-Andrade, R. (2011). Towards Symbolic Run-Time Reconfiguration in Tightly-Coupled Processor Arrays. In Proc. of ReConFig (pp. 392-397). Cancun, MX: New York, NY, USA: IEEE Press.
MLA:
Boppu, Srinivas, et al. "Towards Symbolic Run-Time Reconfiguration in Tightly-Coupled Processor Arrays." Proceedings of the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig'11), Cancun New York, NY, USA: IEEE Press, 2011. 392-397.
BibTeX: Download