O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond

O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond

This article was published in the Journal of Parallel and Distributed Computing [© 2014 Elsevier Inc.] and the definite version is available at :http://dx.doi.org/10.1016/j.jpdc.2014.06.004 The Journal's website is at: http://www.sciencedirect.com/science/article/pii/S0743731514001063

Podrobná bibliografie
Hlavní autoři: Chakrabarty, Amitabha, Collier, Martin J.
Další autoři: Department of Computer Science and Engineering, BRAC University
Médium: Článek
Jazyk:English
Vydáno: © 2014 Elsevier Inc. 2016
Témata:
Complexity
Interconnection networks
Permutation
Rearrangeable networks
Routing tags
On-line přístup:http://hdl.handle.net/10361/7300
http://dx.doi.org/10.1016/j.jpdc.2014.06.004

Internet

http://hdl.handle.net/10361/7300
http://dx.doi.org/10.1016/j.jpdc.2014.06.004

Podobné jednotky