Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
From MaRDI portal
Publication:1904737
DOI10.1007/BF02057160zbMath0836.90092OpenAlexW2089063368WikidataQ57387874 ScholiaQ57387874MaRDI QIDQ1904737
Maciej Drozdowski, Paolo Dell'Olmo, Lucio Bianco, Jacek Błażewicz
Publication date: 2 May 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02057160
Related Items
A simple linear time approximation algorithm for multi-processor job scheduling on four processors, The consecutive multiprocessor job scheduling problem, On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies, Scheduling multiprocessor tasks -- An overview, Lower bound algorithms for multiprocessor task scheduling with ready times
Cites Work
- Unnamed Item
- Unnamed Item
- Preemptive scheduling of independent jobs with release times and deadlines on a hypercube
- Multiprocessor scheduling with communication delays
- Scheduling subject to resource constraints: Classification and complexity
- The complexity of scheduling independent two-processor tasks on dedicated processors
- Preemptive scheduling of independent jobs on a hypercube
- Scheduling multiprocessor tasks on three dedicated processors
- Gang scheduling performance benefits for fine-grain synchronization
- Models and algorithms for coscheduling compute-intensive tasks on a network of workstations
- Scheduling parallel I/O operations in multiple bus systems
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Complexity of Scheduling Parallel Task Systems
- A Heuristic of Scheduling Parallel Tasks and Its Analysis
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling preemptive multiprocessor tasks on dedicated processors
