Augmented binary hypercube: a new architecture for processor management

DOI10.1109/12.536241MaRDI QIDQ4420873zbMATH OpenOpenAlexFDO

Authors Hari Lalgudi, Ian F. Akyildiz, S. Yalamanchili

Publication date 26 October 2003

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.536241

zbMATH Keywords

resource management trafficupdate algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)

Recommendations

• Contention-free 2D-mesh cluster allocation in hypercubes
• Processor allocation for hypercubes
• A fast and efficient processor management scheme for \(k\)-ary \(n\)-cubes
• Scheduling of Jobs in a Hypercube Processing System
• Load sharing in hypercube-connected multicomputers in the presence of node failures

Cited in

(1)

• A fast and efficient processor management scheme for \(k\)-ary \(n\)-cubes

This page was built for publication: Augmented binary hypercube: a new architecture for processor management

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