A method for data allocation and manipulation in hypercube computers

DOI10.1016/0167-8191(93)90002-3MaRDI QIDQ1801369zbMATH OpenOpenAlexFDO

Authors De-Lei Lee, Mokhtar A. Aboelaze

Publication date 14 October 1993

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(93)90002-3

zbMATH Keywords

conflict-free data accessparallel data structuresrouting algorithms

Mathematics Subject Classification ID

Data structures (68P05) Theory of data (68P99) Distributed algorithms (68W15)

Recommendations

• Subcube allocation in hypercube computers
• Processor allocation for hypercubes
• Resource allocation strategies for hypercube architectures
• scientific article; zbMATH DE number 139908
• A link-disjoint subcube for processor allocation in hypercube computers

Cited in

(8)

• Fast data manipulation in multiprocessors using parallel pipelined memories
• Downloading node programs/data into hypercubes
• Resource allocation strategies for hypercube architectures
• Processor allocation for hypercubes
• scientific article; zbMATH DE number 139908 (Why is no real title available?)
• scientific article; zbMATH DE number 549078 (Why is no real title available?)
• Performance of hypercube architecture with shared memory
• scientific article; zbMATH DE number 278851 (Why is no real title available?)

This page was built for publication: A method for data allocation and manipulation in hypercube computers

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