Embedding hypercubes and related networks into mesh-connected processor arrays

DOI10.1006/JPDC.1994.1120zbMATH Open0814.68020OpenAlexW2026935668MaRDI QIDQ1345656FDOQ1345656

Authors: Fred S. Annexstein 

Publication date: 8 March 1995

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1994.1120

Recommendations

• Hypercube emulation of interconnection networks topologies
• On embedding Fibonacci meshes on Fiboacci cube networks
• scientific article; zbMATH DE number 1538536

zbMATH Keywords

hypercubesshuffle-exchangecube-connected-cycles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Time and work optimal simulation of basic reconfigurable meshes on hypercubes
• Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram
• Title not available (Why is that?)
• An asymptotic relation between the wirelength of an embedding and the Wiener index
• Title not available (Why is that?)
• On the reconfigurability of embedded loops on hypercubes and its application
• Compressing cube-connected cycles and butterfly networks
• An alternative mapping of 3-D space onto processor arrays

This page was built for publication: Embedding hypercubes and related networks into mesh-connected processor arrays

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