On-line scheduling of parallel jobs in a list
From MaRDI portal
Publication:954256
DOI10.1007/s10951-007-0032-xzbMath1153.90441OpenAlexW1995217454MaRDI QIDQ954256
Publication date: 10 November 2008
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0032-x
Related Items (12)
Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ Online scheduling of two type parallel jobs on identical machines ⋮ Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines ⋮ Space defragmentation for packing problems ⋮ Improved upper bounds for online malleable job scheduling ⋮ Online multiple-strip packing ⋮ Improved online algorithms for parallel job scheduling and strip packing ⋮ WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION ⋮ Online scheduling of malleable parallel jobs with setup times on two identical machines ⋮ Online Algorithm for Parallel Job Scheduling and Strip Packing ⋮ On-line scheduling of multi-core processor tasks with virtualization ⋮ A note on online strip packing
Cites Work
- Unnamed Item
- Scheduling parallel jobs to minimize the makespan
- Lower bounds for on-line two-dimensional packing algorithms
- Scheduling multiprocessor tasks -- An overview
- Optimal on-line scheduling of parallel jobs with dependencies
- On an on-line scheduling problem for parallel jobs
- Shelf Algorithms for Two-Dimensional Packing Problems
- Complexity of Scheduling Parallel Task Systems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- On-line scheduling of parallel jobs with runtime restrictions
This page was built for publication: On-line scheduling of parallel jobs in a list
