On-line scheduling of parallel jobs with runtime restrictions

DOI10.1016/S0304-3975(00)00260-7zbMath0984.68015MaRDI QIDQ5958714

Bischof, Stefan, Ernst W. Mayr

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

scheduling; makespan; on-line algorithm; parallel job; UET

Mathematics Subject Classification ID

68W10: Parallel algorithms in computer science

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

Related Items

An on-line scheduling problem of parallel machines with common maintenance time, On-line scheduling mesh jobs with dependencies, On-line scheduling of parallel jobs in a list, On-line scheduling of parallel jobs on two machines, On-line scheduling of multi-core processor tasks with virtualization, A web-based ERP system for business services and supply chain management: Application to real-world process scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• Resource constrained scheduling as generalized bin packing
• Dynamic scheduling on parallel machines
• Optimal on-line scheduling of parallel jobs with dependencies
• Fast algorithms for bin packing
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Complexity of Scheduling Parallel Task Systems
• A Heuristic of Scheduling Parallel Tasks and Its Analysis
• Scheduling Opposing Forests
• Scheduling Parallel Machines On-Line
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• The Approximation of Numbers as Sums of Reciprocals