A novel routing scheme on the star and pancake networks and its applications

Parallel Computing

Volumn 19, Issue 1, 1993, Pages 95-101

  Akl, Selim G ^a   Qiu, Ke ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Data routing; hypercube; interconnection networks; minimum spanning forests; pancake; star

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; DATA HANDLING; DATA STRUCTURES; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY;

DATA ROUTING; HYPERCUBE ARCHITECTURE; INTERCONNECTION NETWORKS; MINIMUM SPANNING FORESTS; PANCAKE NETWORKS; ROUTING; STAR NETWORKS; TIME COMPLEXITY;

PARALLEL PROCESSING SYSTEMS;

EID: 0027306611     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(93)90107-V     Document Type: Article

References (10)

1. A group theoretic model for symmetric interconnection networks
2. The star graph: An attractive alternative to the n-cube
3. Parallel minimum spanning forest algorithms on the star and pancake interconnection networks
4. Data communication and computational geometry on the star and pancake interconnection networks
5. Sorting networks and their applications
6. Parallel graph algorithms for hypercube computers
7. Two minimum spanning forest algorithms on fixed-size hypercube computers
8. The cube-connected-cycle: A versatile network for parallel computation
9. The star and pancake interconnection networks: Properties and algorithms