Skip to main content

Folded Fat H-Tree: An Interconnection Topology for Dynamically Reconfigurable Processor Array

  • Conference paper
Embedded and Ubiquitous Computing (EUC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3207))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Motomura, M.: A Dynamically Reconfigurable Processor Architecture. Microprocessor Forum (October 2002)

    Google Scholar 

  2. IPFlex Inc., http://www.ipflex.com

  3. Master, P.: The Age of Adaptive Computing Is Here. In: Proceedings of the Field-Programmable Logic and Applications, September 2002, pp. 1–3 (2002)

    Google Scholar 

  4. PACT XPP Technologies, http://www.pactcorp.com

  5. Schmit, H., Whelihan, D., Tsai, A., Moe, M., Levine, B., Taylor, R.R.: PipeRench: AVirtualized Programmable Datapath in 0.18 Micron Technology. In: Proceedings of the IEEE Custom Integrated Circuits Conference (CICC), October 2002, pp. 63–66 (2002)

    Google Scholar 

  6. Anjo, K., Yamada, Y., Koibuchi, M., Jouraku, A., Amano, H.: BLACK-BUS: A New Data-Tranfer Technique using Local Address on Networks-on-Chips. In: Proceedings of IEEE International conference on Parallel and Disptributed Processing Systems (April 2004)

    Google Scholar 

  7. Capsi, E., Chu, M., Huang, R., Yeh, J., Wawrzynek, J., De Hon, A.: Stream Computations Organized for Reconfigurable Execution (SCORE). In: Proceedings of the Field-Programmable Logic and Applicatoins, September 2000, pp. 605–615 (2000)

    Google Scholar 

  8. Hon, A.D.: Compact, Multilayer Layout for Butterfly Fat-Tree. In: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, July 2000, pp. 206–215 (2000)

    Google Scholar 

  9. Yang, Y., Funahashi, A., Nishi, H., Amano, H., Sueyoshi, T.: Recursive Diagonal Torsu: an interconnection network for massively parallel computers. IEEE Transaction on Parallel and Distributed Systems 12(7), 701–715 (2000)

    Article  Google Scholar 

  10. Schroedor, M.D., et al.: Autonet: a high-speed self configuring local area network using point-to-point links. IEEE Selected Area in Communications 9, 1318–1335 (1991)

    Article  Google Scholar 

  11. Leiserson, C.E.: Fat-trees: Universal Networks for Hardware-Efficient Supercomputing. IEEE Transaction on Computer 34(10), 892–901 (1985)

    Google Scholar 

  12. Dally, W.J., Towles, B.: Route Packets, Not Wires: On-Chip Interconnection Networks. In: Proceedings of 38th Design Automation Conference, June 2001, pp. 684–689 (2001)

    Google Scholar 

  13. Snacho, J.C., Robles, A., Duato, J.: Effective Strategy to Compute Forwarding Tables for InfiniBand Networks. In: Proceedings of the International Conference of Parallel Processing, January 2001, pp. 48–53 (2001)

    Google Scholar 

  14. Dally, W.J.: Virtual Channel Flow Control. IEEE Transaction on Parallel and Distributed Systems 3(2), 194–205 (1992)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. In: Yang, L.T., Guo, M., Gao, G.R., Jha, N.K. (eds) Embedded and Ubiquitous Computing. EUC 2004. Lecture Notes in Computer Science, vol 3207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30121-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30121-9_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22906-3

  • Online ISBN: 978-3-540-30121-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics