Cart (Loading....) | Create Account
Close category search window

Adaptive routing algorithms and implementation for interconnection network TESH for parallel processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Miura, Y. ; Shonan Inst. of Technol., Fujisawa, Japan ; Kaneko, M. ; Watanabe, S.

We introduce three adaptive routing algorithms for the hierarchical interconnection network TESH (tori-connected meshes) and evaluate their hardware costs and delays. TESH, which consists of a hierarchical torus interconnection between meshes as a basic module, is one of the k-ary n-cube networks, for which many adaptive routing algorithms have already been proposed. Adaptive routings for TESH have also been proposed in previous work.

Published in:

Local Computer Networks (LCN), 2010 IEEE 35th Conference on

Date of Conference:

10-14 Oct. 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.