Loading...
Search for:
message-lengths
0.006 seconds
Broadcast algorithms on OTIS-Cubes
, Article 2008 International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008, Sydney, NSW, 10 December 2008 through 12 December 2008 ; December , 2008 , Pages 637-642 ; 9780769534718 (ISBN) ; Sarbazi Azad, H ; Sharif University of Technology
2008
Abstract
OTIS-based architectures appear to have the potential to be an interesting option for future generations of multiprocessing systems. In this paper, we propose a new adaptive unicast routing algorithm and four software-based (unicast-based) broadcast algorithms for the wormhole switched OTI S-hypercube. We then present an empirical performance evaluation of these algorithms in OTIS-hypercube for different topologies, message length and traffic loads. © 2008 IEEE
A general methodology for direction-based irregular routing algorithms
, Article Journal of Parallel and Distributed Computing ; Volume 70, Issue 4 , 2010 , Pages 363-370 ; 07437315 (ISSN) ; Sarbazi Azad, H ; Zomaya, A. Y ; Sharif University of Technology
Abstract
This paper presents a general methodology for generating deadlock-free routing algorithms for irregular networks. Constructing a spanning tree on the given network, assigning directions to the network channels, creating deadlock-free zones, and specifying a logical sequence of the produced deadlock-free zones are the four fundamental steps that the proposed methodology takes to generate deadlock-free and connected routing algorithms. By applying the proposed methodology with two known labeling methods we have generated six irregular routing algorithms: three of them are novel routing algorithms and three of them (the Up/Down, Left/Right, and L-turn routing algorithms) have already been...