Routing algorithms for the shuffle-exchange permutation network

For a natural number n , let S n denote the symmetric group on n letters. Let SEP n be the Cayley graph Cay ( S n , { σ , σ - 1 , τ } ) , where τ = ( 12 ) and σ = ( 1 , … , n ) . In this note, we present an easy static routing algorithm for SEP n which gives us an exact formula for the path between...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The Journal of supercomputing 2021, Vol.77 (10), p.11556-11574
Hauptverfasser:	Khosravi, Behnam, Khosravi, Behrooz, Khosravi, Bahman
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Compilers Computer Science Interpreters Mathematical analysis Permutations Processor Architectures Programming Languages Routing (telecommunications) Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!