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

Bibliografiske detaljer
Main Authors:	Chakrabarty, Amitabha, Collier, Martin J.
Andre forfattere:	Department of Computer Science and Engineering, BRAC University
Format:	Article
Sprog:	English
Udgivet:	© 2014 Elsevier Inc. 2016
Fag:	Complexity Interconnection networks Permutation Rearrangeable networks Routing tags
Online adgang:	http://hdl.handle.net/10361/7300 http://dx.doi.org/10.1016/j.jpdc.2014.06.004

id	10361-7300
record_format	dspace
spelling	10361-73002022-01-27T03:12:50Z O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond Chakrabarty, Amitabha Collier, Martin J. Department of Computer Science and Engineering, BRAC University Complexity Interconnection networks Permutation Rearrangeable networks Routing tags 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 This paper addresses routing algorithm for a classic network called rearrangeable network with a complexity which is minimum than any other reported algorithms in this class. A new routing algorithm is presented for symmetric rearrangeable networks built with 2 × 2 switching elements. This new algorithm is capable of connection setup for partial permutation, over(m, -) = ρ N, where N is the total input numbers and over(m, -) is the number of active inputs. Overall the serial time complexity of this method is O (N log N)1 1 All log in this paper are base-2. and O (over(m, -) . log N) where all N inputs are active and with over(m, -) < N active inputs respectively. The time complexity of this algorithm in a parallel machine with N completely connected processors is O (log2 N). With over(m, -) active requests the time complexity goes down to O (log over(m, -) . log N), which is better than the O (log2 over(m, -) + log N), reported in the literature for 2frac(1, 2) [(log2 N - 4 log N)frac(1, 2) - log N] ≤ ρ ≤ 1. In later half of this paper, modified rearrangeable networks have been demonstrated built with bigger switching elements (> 2 × 2) with shorter network depth. Routing algorithm for these new networks have been proposed by modifying the proposed algorithm for smaller switching elements networks. Also we shall look into the application of these networks in optical domain for crosstalk free routing. Published 2016-12-21T05:07:46Z 2016-12-21T05:07:46Z 2014 Article Chakrabarty, A., & Collier, M. (2014). O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond. Journal of Parallel and Distributed Computing, doi:10.1016/j.jpdc.2014.06.004 7437315 http://hdl.handle.net/10361/7300 http://dx.doi.org/10.1016/j.jpdc.2014.06.004 en http://www.sciencedirect.com/science/article/pii/S0743731514001063 © 2014 Elsevier Inc.
institution	Brac University
collection	Institutional Repository
language	English
topic	Complexity Interconnection networks Permutation Rearrangeable networks Routing tags
spellingShingle	Complexity Interconnection networks Permutation Rearrangeable networks Routing tags Chakrabarty, Amitabha Collier, Martin J. O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
description	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
author2	Department of Computer Science and Engineering, BRAC University
author_facet	Department of Computer Science and Engineering, BRAC University Chakrabarty, Amitabha Collier, Martin J.
format	Article
author	Chakrabarty, Amitabha Collier, Martin J.
author_sort	Chakrabarty, Amitabha
title	O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
title_short	O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
title_full	O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
title_fullStr	O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
title_full_unstemmed	O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
title_sort	o (log over(m, -) . log n) routing algorithm for (2 log n - 1)-stage switching networks and beyond
publisher	© 2014 Elsevier Inc.
publishDate	2016
url	http://hdl.handle.net/10361/7300 http://dx.doi.org/10.1016/j.jpdc.2014.06.004
work_keys_str_mv	AT chakrabartyamitabha ologovermlognroutingalgorithmfor2logn1stageswitchingnetworksandbeyond AT colliermartinj ologovermlognroutingalgorithmfor2logn1stageswitchingnetworksandbeyond
_version_	1814307465530966016

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

Lignende værker