Scheduling of Jobs in a Hypercube Processing System

DOI10.1057/JORS.1996.75MaRDI QIDQ4717121zbMATH OpenOpenAlexFDO

Authors Inder Khosla, Sourav Bhattacharya, Wei-Tek Tsai

Publication date 13 April 1997

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1996.75

zbMATH Keywords

hypercube multiprocessorhypercube scheduling problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4050979
• Scheduling independent jobs on partitionable hypercubes
• Preemptive scheduling of independent jobs on a hypercube
• scientific article; zbMATH DE number 2247728

Cited in

(8)

• Preemptive scheduling of independent jobs on a hypercube
• Scheduling independent jobs on partitionable hypercubes
• A fast and efficient processor management scheme for \(k\)-ary \(n\)-cubes
• Hierarchical scheduling of dynamical parallel computations on hypercube multicomputers
• An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension
• A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES
• scientific article; zbMATH DE number 4050979 (Why is no real title available?)
• Augmented binary hypercube: a new architecture for processor management

This page was built for publication: Scheduling of Jobs in a Hypercube Processing System

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