Preemptive scheduling of independent jobs on a hypercube
From MaRDI portal
Publication:1111373
DOI10.1016/0020-0190(88)90209-8zbMath0658.68041OpenAlexW1996376059MaRDI QIDQ1111373
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(88)90209-8
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (8)
Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors ⋮ An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension ⋮ Preemptive scheduling of independent jobs with release times and deadlines on a hypercube ⋮ An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube ⋮ Scheduling on a hypercube ⋮ Scheduling multiprocessor tasks -- An overview ⋮ The master-slave paradigm in parallel computer and industrial settings ⋮ An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
Cites Work
This page was built for publication: Preemptive scheduling of independent jobs on a hypercube
