On recurrent and recursive interconnection patterns

DOI10.1016/0020-0190(86)90067-0MaRDI QIDQ1077935zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3646281 (Why is no real title available?)
• scientific article; zbMATH DE number 4155875 (Why is no real title available?)
• Efficiency of universal parallel computers
• Infinite cube-connected cycles
• Parallel Processing with the Perfect Shuffle

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
• scientific article; zbMATH DE number 436070 (Why is no real title available?)
• 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)