Scheduling in the dark

DOI10.1016/S0304-3975(99)00186-3zbMath0938.68016MaRDI QIDQ5918075

No author found.

Publication date: 4 June 2000

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

zbMATH Keywords

schedulingcompetitive ratioresponseequal-partition

Mathematics Subject Classification ID

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

Related Items (12)

Semi-clairvoyant scheduling ⋮ Energy-efficient multiprocessor scheduling for flow time and makespan ⋮ Nonclairvoyant speed scaling for flow and energy ⋮ Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency ⋮ Scheduling parallel jobs online with convex and concave parallelizability ⋮ Energy efficient scheduling of parallelizable jobs ⋮ Speed scaling of processes with arbitrary speedup curves on a multiprocessor ⋮ Minimizing the maximum starting time on-line ⋮ A note on on-line broadcast scheduling with deadlines ⋮ Non-clairvoyant scheduling for weighted flow time ⋮ Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems ⋮ Non-clairvoyant weighted flow time scheduling on different multi-processor models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive snoopy caching
• On multiprocessor system scheduling
• Using parallel program characteristics in dynamic processor allocation policies
• Minimizing flow time nonclairvoyantly
• Smart SMART Bounds for Weighted Response Time Scheduling
• Application scheduling and processor allocation in multiprogrammed parallel processing systems

This page was built for publication: Scheduling in the dark