On-line scheduling of multi-core processor tasks with virtualization
From MaRDI portal
Publication:991470
DOI10.1016/J.ORL.2010.04.002zbMATH Open1193.90119OpenAlexW2079584040MaRDI QIDQ991470FDOQ991470
Authors: Deshi Ye, Guochuan Zhang 
Publication date: 7 September 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.04.002
Recommendations
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- On-line scheduling revisited
- Online algorithms. The state of the art
- Bounds for Certain Multiprocessing Anomalies
- Lower bounds for on-line two-dimensional packing algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on online strip packing
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Scheduling parallel jobs to minimize the makespan
- Online scheduling of parallel jobs on two machines is 2-competitive
- Online strip packing with modifiable boxes
- On-line scheduling of parallel jobs with runtime restrictions
- Dynamic scheduling on parallel machines
- Title not available (Why is that?)
- Optimal on-line scheduling of parallel jobs with dependencies
- On an on-line scheduling problem for parallel jobs
- On-line scheduling of parallel jobs in a list
- Algorithms and Computation
- On-line scheduling of parallel jobs on two machines
- Bandwidth Allocation with Preemption
Cited In (1)
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)
