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
| Main Authors: | Chakrabarty, Amitabha, Collier, Martin J. |
|---|---|
| Other Authors: | Department of Computer Science and Engineering, BRAC University |
| Format: | Article |
| Language: | English |
| Published: |
© 2014 Elsevier Inc.
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10361/7300 http://dx.doi.org/10.1016/j.jpdc.2014.06.004 |
Similar Items
-
Low complexity routing algorithm for rearrangeable switching networks
by: Chakrabarty, Amitabha, et al.
Published: (2016) - Log
-
Cost efficient implementation of multistage symmetric repackable networks
by: Chakrabarty, Dr. Amitabha, et al.
Published: (2016) -
The Hemingway Log
by: Chamberlin -
The Log Cabin
by: Hoagland