On-line scheduling of parallel jobs

DOI10.1007/3-540-58338-6_65zbMath1493.68038OpenAlexW1481317444MaRDI QIDQ5096875

Jiří Sgall

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_65

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Improved upper bounds for online malleable job scheduling ⋮ Online malleable job scheduling for \(m\leq 3\) ⋮ Competitive online scheduling of perfectly malleable jobs with setup times ⋮ Semi on-line algorithms for the partition problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• New algorithms for an ancient scheduling problem.
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Complexity of Scheduling Parallel Task Systems
• A Heuristic of Scheduling Parallel Tasks and Its Analysis
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• Optimal online scheduling of parallel jobs with dependencies
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: On-line scheduling of parallel jobs