Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
From MaRDI portal
Publication:3340134
Recommendations
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints
- Preemptive Scheduling of Uniform Processor Systems
- Nearly on-line scheduling of multiprocessor systems with memories
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- Preemptive scheduling with deadlines on parallel machines
- Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness
- Preemptive Scheduling of Parallel Jobs on Multiprocessors
- scientific article; zbMATH DE number 871911
- An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems
Cited in
(7)- Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- scientific article; zbMATH DE number 2086672 (Why is no real title available?)
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- The maximum gain of increasing the number of preemptions in multiprocessor scheduling
- Nearly on-line scheduling of multiprocessor systems with memories
- Scheduling parallel machines with inclusive processing set restrictions and job release times
This page was built for publication: Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340134)