On an on-line scheduling problem for parallel jobs

DOI10.1016/S0020-0190(01)00241-1zbMath1013.68027MaRDI QIDQ1603586

Uwe Schwiegelshohn, Edwin Naroska

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

schedulinganalysis of algorithmson-line algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Online scheduling of two type parallel jobs on identical machines, Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms, Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems, Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion, On-line hierarchical job scheduling on grids with admissible allocation, Scheduling parallel jobs to minimize the makespan, Improved upper bounds for online malleable job scheduling, A system-centric metric for the evaluation of online job schedules, Approximation algorithms for energy-efficient scheduling of parallel jobs, A web-based ERP system for business services and supply chain management: Application to real-world process scheduling, On-line scheduling of parallel jobs in a list, On-line scheduling of parallel jobs on two machines, Online scheduling of malleable parallel jobs with setup times on two identical machines, On-line scheduling of multi-core processor tasks with virtualization, Utilization of nonclairvoyant online schedules

Cites Work

• Dynamic scheduling on parallel machines
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Scheduling Parallel Machines On-Line
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies