On-line scheduling of parallel jobs in a list

DOI10.1007/s10951-007-0032-xzbMath1153.90441MaRDI QIDQ954256

Deshi Ye, Guo-Chuan Zhang

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

zbMATH Keywords

parallel computing; competitive ratio; on-line scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Online Algorithm for Parallel Job Scheduling and Strip Packing, Online multiple-strip packing, Improved online algorithms for parallel job scheduling and strip packing, Improved upper bounds for online malleable job scheduling, Online scheduling of malleable parallel jobs with setup times on two identical machines, On-line scheduling of multi-core processor tasks with virtualization, A note on online strip packing, Space defragmentation for packing problems, Coordination Mechanisms for Selfish Parallel Jobs Scheduling, WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION, Online scheduling of two type parallel jobs on identical machines, Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines

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