Scheduling on a hypercube

DOI10.1016/0020-0190(91)90201-RzbMath0741.68061OpenAlexW2042349969MaRDI QIDQ1183498

Xiao-Jun Shen, Edward M. Reingold

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90201-r

zbMATH Keywords

hypercubescheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Scheduling multiprocessor tasks -- An overview

Cites Work

• Unnamed Item
• An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
• Preemptive scheduling of independent jobs on a hypercube
• NP-complete scheduling problems
• Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints
• Combinatorial Optimization with Rational Objective Functions

This page was built for publication: Scheduling on a hypercube