Processor allocation for hypercubes

DOI10.1016/0743-7315(92)90022-FzbMATH Open0797.68019MaRDI QIDQ1208596FDOQ1208596

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)

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

zbMATH Keywords

hypercube computersmultiprocessingprocessor allocationbuddy tree algorithmsubcube recognition

Mathematics Subject Classification ID

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

Cited In (9)

• 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
• Title not available (Why is that?)
• Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds
• A method for data allocation and manipulation in hypercube computers
• Resource allocation strategies for hypercube architectures
• Title not available (Why is that?)

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)