Folded fat H-Tree: An interconnection topology for dynamically reconfigurable processor array

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Fat H-Tree is a novel on-chip network topology for a dynamic reconfigurable processor array. It includes both fat tree and torus structure, and suitable to map tasks in a stream processing. For on-chip implementation, folding layout is also proposed. Evaluation results show that Fat H-Tree reduces the distance of H-Tree from 13% to 55%, and stretches the throughput almost three times. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Yamada, Y., Amano, H., Koibuchi, M., Jouraku, A., Anjo, K., & Nishimura, K. (2004). Folded fat H-Tree: An interconnection topology for dynamically reconfigurable processor array. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3207, 301–311. https://doi.org/10.1007/978-3-540-30121-9_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free