A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network

Author： Rahman M.M. Hafizur Horiguchi Susumu

Publisher： Inderscience Publishers

ISSN： 1740-0562

Source： International Journal of High Performance Computing and Networking, Vol.4, Iss.3-4, 2006-08, pp. : 174-187

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing

By Schwiebert L. Jayasimha D.N.

Journal of Parallel and Distributed Computing, Vol. 32, Iss. 1, 1996-01 ,pp. : 103-117

Academic Press

Access to resources Recommend Favorite

A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks

By Park H. Agrawal D.P.

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 9, 2001-09 ,pp. : 1225-1248

Academic Press

Access to resources Recommend Favorite

Deadlock-free motion planning using the Laplace potential field

By Sato Keisuke

Advanced Robotics, Vol. 7, Iss. 5, 1992-01 ,pp. : 449-461

Taylor & Francis Ltd

Access to resources Recommend Favorite

A deadlock-free algorithm for planning a collision-free coordinated motion for two mobile robots amidst unknown environments

By Liu Yun-Hui Arimoto Suguru

Advanced Robotics, Vol. 7, Iss. 5, 1992-01 ,pp. : 507-522

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Generalized Deadlock-Free Process Calculus

By Sumii E. Kobayashi N.

Electronic Notes in Theoretical Computer Science, Vol. 16, Iss. 3, 2004-01 ,pp. : 1-23

Elsevier

Access to resources Recommend Favorite