On recurrent and recursive interconnection patterns

DOI10.1016/0020-0190(86)90067-0zbMATH Open0595.68059OpenAlexW2055822958MaRDI QIDQ1077935FDOQ1077935

Authors: Ian Parberry 

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90067-0

Recommendations

• Embedded connectivity of recursive networks
• Recursive Functions with Pattern Matching in Interaction Nets
• scientific article; zbMATH DE number 140108
• Recursive cubes of rings as models for interconnection networks
• Routing properties of a recursive interconnection network
• scientific article; zbMATH DE number 3859160
• scientific article; zbMATH DE number 436070
• Conditional connectivity of recursive interconnection networks respect to embedding restriction
• A note on interconnections

zbMATH Keywords

parallel computationtrivalent graphscube-connected cycleslarge parallel machinesshuffle- exchangesynchronous parallel computers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Parallel Processing with the Perfect Shuffle
• Efficiency of universal parallel computers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Infinite cube-connected cycles

Cited In (5)

• A unified theory of interconnection network structure
• Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays
• An optimal time bound for oblivious routing
• Title not available (Why is that?)
• Recursive Functions with Pattern Matching in Interaction Nets

This page was built for publication: On recurrent and recursive interconnection patterns

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