Mapping rings and grids onto the FPS T-series hypercube

DOI10.1016/0167-8191(88)90093-2zbMATH Open0647.68006OpenAlexW1971902797MaRDI QIDQ1104726FDOQ1104726

Authors David A. Poplawski

Publication date 1988

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(88)90093-2

zbMATH Keywords

parallel processingFPS T- series hypercubemapping rings and gridsoverhead elimating

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Theory of software (68N99) Theory of operating systems (68N25)

Recommendations

• Routing multiple paths in hypercubes
• Embedding of Grids into Optimal Hypercubes
• Hypercube emulation of interconnection networks topologies
• On the communication structures of hyper-ring and hypercube multicomputers
• On embedding rectangular grids in hypercubes

Cited in

(3)

• Partial sum problem mapping into a hypercube
• Thick brane solutions supported by two spinor fields
• Spacetime deformation-induced inertia effects

This page was built for publication: Mapping rings and grids onto the FPS T-series hypercube

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