On-line scheduling of multi-core processor tasks with virtualization
From MaRDI portal
(Redirected from Publication:991470)
Recommendations
Cites work
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- scientific article; zbMATH DE number 3848585 (Why is no real title available?)
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- A note on online strip packing
- Algorithms and Computation
- Bandwidth Allocation with Preemption
- Bounds for Certain Multiprocessing Anomalies
- Dynamic scheduling on parallel machines
- Lower bounds for on-line two-dimensional packing algorithms
- On an on-line scheduling problem for parallel jobs
- On-line scheduling of parallel jobs in a list
- On-line scheduling of parallel jobs on two machines
- On-line scheduling of parallel jobs with runtime restrictions
- On-line scheduling revisited
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Online algorithms. The state of the art
- Online scheduling of parallel jobs on two machines is 2-competitive
- Online strip packing with modifiable boxes
- Optimal on-line scheduling of parallel jobs with dependencies
- Scheduling parallel jobs to minimize the makespan
This page was built for publication: On-line scheduling of multi-core processor tasks with virtualization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991470)