On-line scheduling of parallel jobs on two machines

DOI10.1016/j.jda.2006.07.005zbMath1279.90062MaRDI QIDQ954945

Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Deshi Ye, Guo-Chuan Zhang

Publication date: 18 November 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.07.005

zbMATH Keywords

competitive analysis; online algorithms; jobs scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Online scheduling of parallel jobs on two machines is 2-competitive, Online scheduling of malleable parallel jobs with setup times on two identical machines, On-line scheduling of multi-core processor tasks with virtualization, Online over time processing of combinatorial problems, ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES, 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
• Unnamed Item
• Unnamed Item
• Optimal on-line scheduling of parallel jobs with dependencies
• On an on-line scheduling problem for parallel jobs
• Structural Information and Communication Complexity
• Bounds for Certain Multiprocessing Anomalies
• On-line scheduling of parallel jobs with runtime restrictions