Processor allocation for hypercubes

DOI10.1016/0743-7315(92)90022-FMaRDI QIDQ1208596zbMATH OpenFDO

Authors S. Al-Bassam, Hesham El-Rewini, T. G. Lewis, Bella Bose

Publication date 16 May 1993

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

Full work available at URL https://doi.org/10.1016/0743-7315(92)90022-F

zbMATH Keywords

buddy tree algorithmhypercube computersmultiprocessingprocessor allocationsubcube recognition

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Recommendations

• Resource allocation strategies for hypercube architectures
• A method for data allocation and manipulation in hypercube computers
• A link-disjoint subcube for processor allocation in hypercube computers
• Subcube fault tolerance in hypercube multiprocessors
• Contention-free 2D-mesh cluster allocation in hypercubes

Cited in

(10)

• Resource allocation strategies for hypercube architectures
• A link-disjoint subcube for processor allocation in hypercube computers
• A method for data allocation and manipulation in hypercube computers
• scientific article; zbMATH DE number 437523 (Why is no real title available?)
• Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds
• scientific article; zbMATH DE number 549078 (Why is no real title available?)
• Augmented binary hypercube: a new architecture for processor management
• Contention-free 2D-mesh cluster allocation in hypercubes
• Fast and efficient processor allocation algorithm for torus-based chip multiprocessors
• Maximizing the throughput of parallel jobs on hypercubes

This page was built for publication: Processor allocation for hypercubes

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