Partial sum problem mapping into a hypercube

DOI10.1016/0020-0190(90)90145-NMaRDI QIDQ918652zbMATH OpenOpenAlexFDO

Authors Hyoung Joong Kim, Jang Gyu Lee

Publication date 1990

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

Full work available at URL https://doi.org/10.1016/0020-0190(90)90145-n

zbMATH Keywords

hypercubeGray codeparallel computingpartial sum

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Mathematical problems of computer architecture (68M07)

Recommendations

• Cluster partitioning approaches to mapping parallel programs onto a hypercube
• Hypercube embedding heuristics: An evaluation
• An efficient algorithm for gray-to-binary permutation on hypercubes
• Mapping rings and grids onto the FPS T-series hypercube
• High Performance Computing - HiPC 2003

Cites work

• scientific article; zbMATH DE number 4033059 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• Parallel Computers 2

This page was built for publication: Partial sum problem mapping into a hypercube

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