Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
From MaRDI portal
Publication:3069900
Recommendations
- Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
- Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times
- Non-clairvoyant scheduling for weighted flow time
- scientific article; zbMATH DE number 1962819
- Non-clairvoyant scheduling for minimizing mean slowdown
- Non-clairvoyant weighted flow time scheduling on different multi-processor models
- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
- Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
- Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
- Parallel-machine scheduling with non-simultaneous machine available time
Cited in
(20)- Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
- Nonclairvoyant speed scaling for flow and energy
- Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
- Speed scaling of processes with arbitrary speedup curves on a multiprocessor
- Approximating total flow time on parallel machines
- Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
- Minimizing flow time nonclairvoyantly
- An Optimal Strategy for Online Non-uniform Length Order Scheduling
- Non-clairvoyantly scheduling to minimize convex functions
- Non-clairvoyant scheduling for weighted flow time
- Greedy scheduling with custom-made objectives
- Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times
- Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
- Competitive algorithms from competitive equilibria, non-clairvoyant scheduling under polyhedral constraints
- Non-clairvoyant scheduling for minimizing mean slowdown
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- Achievable performance of blind policies in heavy traffic
- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework
- A scheduling framework for distributed key-value stores and its application to tail latency minimization
This page was built for publication: Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069900)
