Fast self-routing permutation switching on an asymptotically minimum cost network

Fast self-routing permutation switching on an asymptotically minimum cost network

A self-routing permutation network with O((n lg n)) switches and O(lg/sup 2/n) routing time, where lg denotes log/sub 2/, is presented. More generally, a permutation network with O(kn/sup 1+1/k/) cost and O(k lg n) routing time for any k, 1

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 1993-12, Vol.42 (12), p.1469-1479
Hauptverfasser: Ching Yuh Jan, Oruc, A.Y.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Communication switching
Computer networks
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Cost function
Exact sciences and technology
Logic devices
Logic gates
Multiprocessor interconnection networks
Packet switching
Routing
Software
Sorting
Switches
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A self-routing permutation network with O((n lg n)) switches and O(lg/sup 2/n) routing time, where lg denotes log/sub 2/, is presented. More generally, a permutation network with O(kn/sup 1+1/k/) cost and O(k lg n) routing time for any k, 1
ISSN:0018-9340
1557-9956
DOI:10.1109/12.260636