Hybrid turn-prohibition routing algorithm for the networks of workstations

Document Type

Conference Proceeding

Publication Date

12-1-2004

Abstract

Deadlock is a critical problem of any wormhole network. Algorithms have been developed to avoid or recover from deadlocks. In existing approaches for deadlock-free routing any possibility of deadlock occurrence is eliminated, which can result in putting extra restrictions on the routing or put no restrictions on routing, which leads to other approach namely deadlock recovery. In this paper we are considering hybrid approach for routing, where some prohibition is imposed on routing along with some kind of deadlock recovery. This hybrid approach allows changing the amount of routing restrictions depending on network traffic, thus providing a flexible method to achieve better network performance compared to the existing techniques. The main idea of the proposed method consists in the sequential selections of some turns, which are prohibited during routing. Cost formula is proposed to estimate cost of implementing both strategies in a network.

Identifier

12244288627 (Scopus)

ISBN

[1932415262, 9781932415261]

Publication Title

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA 04

First Page

1383

Last Page

1389

Volume

3

This document is currently not available here.

Share

COinS