Topological properties of the recursive Petersen architecture

DOI10.1016/0895-7177(95)00076-EzbMATH Open0833.68010MaRDI QIDQ1900250FDOQ1900250

Authors: A. A. Nanavati, Ahmed El-Amawy, S. S. Iyengar 

Publication date: 30 October 1995

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Recommendations

• Topology and routing algorithms of double-loops connected Petersen graph networks
• A high performance interconnection network for multiprocessor systems
• A practical interconnection network \(\text{RP}(k)\) and its routing algorithms
• Optimal generalized Petersen graphs
• Extended Petersen networks

zbMATH Keywords

interconnection networkPetersen graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• The Universality of the Shuffle-Exchange Network
• Parallel Processing with the Perfect Shuffle
• Title not available (Why is that?)
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI

Cited In (5)

• A high performance interconnection network for multiprocessor systems
• On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings
• On the interconnected networks based on ringed crossed-cube Petersen
• Topology and routing algorithms of double-loops connected Petersen graph networks
• Extended Petersen networks

This page was built for publication: Topological properties of the recursive Petersen architecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900250)