scientific article; zbMATH DE number 4050979

MaRDI QIDQ3787470zbMATH OpenFDO

Authors Guan-Ing Chen, Ten H. Lai

Publication date 1988

zbMATH Keywords

heuristic finishing timehypercubeNP-completescheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• Scheduling independent jobs on partitionable hypercubes
• Scheduling of Jobs in a Hypercube Processing System
• Preemptive scheduling of independent jobs on a hypercube
• An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension
• scientific article; zbMATH DE number 2247728

Cited in

(11)

• Preemptive scheduling of independent jobs on a hypercube
• Scheduling independent jobs on partitionable hypercubes
• An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension
• Scheduling of independent jobs in star graph networks
• A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES
• scientific article; zbMATH DE number 559037 (Why is no real title available?)
• Scheduling of Jobs in a Hypercube Processing System
• On-line scheduling of parallel jobs
• scientific article; zbMATH DE number 2247728 (Why is no real title available?)
• Walk on the hypercube with minimum similarities
• An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube

This page was built for publication:

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