Scheduling in the dark

DOI10.1016/S0304-3975(99)00186-3MaRDI QIDQ5918075zbMATH OpenFDO

Authors Jeff Edmonds

Publication date 4 June 2000

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

Full work available at URL https://doi.org/10.1016/S0304-3975(99)00186-3

zbMATH Keywords

competitive ratioequal-partitionresponsescheduling

Mathematics Subject Classification ID

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

Recommendations

• Scheduling in the dark
• Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
• scientific article; zbMATH DE number 1559528
• scientific article; zbMATH DE number 437567

Cites work

• Application scheduling and processor allocation in multiprogrammed parallel processing systems
• Competitive snoopy caching
• scientific article; zbMATH DE number 437567 (Why is no real title available?)
• scientific article; zbMATH DE number 437571 (Why is no real title available?)
• scientific article; zbMATH DE number 15120 (Why is no real title available?)
• scientific article; zbMATH DE number 1306855 (Why is no real title available?)
• scientific article; zbMATH DE number 1003241 (Why is no real title available?)
• scientific article; zbMATH DE number 1559527 (Why is no real title available?)
• scientific article; zbMATH DE number 1559528 (Why is no real title available?)
• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• scientific article; zbMATH DE number 1383710 (Why is no real title available?)
• scientific article; zbMATH DE number 871911 (Why is no real title available?)
• Minimizing flow time nonclairvoyantly
• On multiprocessor system scheduling
• Smart SMART Bounds for Weighted Response Time Scheduling
• Using parallel program characteristics in dynamic processor allocation policies

Cited in

(21)

• Idle regulation in non-clairvoyant scheduling of parallel jobs
• Non-clairvoyant scheduling for weighted flow time
• Scheduling parallel jobs online with convex and concave parallelizability
• Energy efficient scheduling of parallelizable jobs
• Minimizing the maximum starting time on-line
• Semi-clairvoyant scheduling
• Non-clairvoyant weighted flow time scheduling on different multi-processor models
• Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
• Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
• Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
• Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
• Energy-efficient multiprocessor scheduling for flow time and makespan
• scientific article; zbMATH DE number 1559528 (Why is no real title available?)
• scientific article; zbMATH DE number 2086383 (Why is no real title available?)
• Scheduling in the dark
• On scheduling parallel tasks at twilight
• Nonclairvoyant speed scaling for flow and energy
• Dynamic batching of online arrivals to leverage economies of scale
• Speed scaling of processes with arbitrary speedup curves on a multiprocessor
• Maximizing throughput for parallel jobs with speed-up curves
• A note on on-line broadcast scheduling with deadlines

This page was built for publication: Scheduling in the dark

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918075)