The following pages link to Nonclairvoyant scheduling (Q1331961):
Displaying 32 items.
- Online scheduling FIFO policies with admission and push-out (Q255276) (← links)
- Speed scaling for stretch plus energy (Q439911) (← links)
- Transactional scheduling for read-dominated workloads (Q456006) (← links)
- Nonclairvoyant speed scaling for flow and energy (Q644794) (← links)
- On the competitiveness of AIMD-TCP within a general network (Q690448) (← links)
- Speed scaling of processes with arbitrary speedup curves on a multiprocessor (Q693765) (← links)
- Transactional contention management as a Non-clairvoyant scheduling problem (Q848634) (← links)
- Scheduling search procedures: The wheel of fortune (Q880568) (← links)
- Probabilistic analysis for scheduling with conflicts (Q924143) (← links)
- TCP is competitive with resource augmentation (Q987404) (← links)
- New algorithms for related machines with temporary jobs. (Q1588054) (← links)
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine (Q1592755) (← links)
- Online strategies for backups (Q1608336) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
- Performance guarantees for hierarchical clustering (Q1780451) (← links)
- Semi-clairvoyant scheduling (Q1887092) (← links)
- Window-based greedy contention management for transactional memory: theory and practice (Q1938368) (← links)
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627) (← links)
- Non-clairvoyant weighted flow time scheduling on different multi-processor models (Q2344210) (← links)
- The impact of processing order on performance: a taxonomy of semi-FIFO policies (Q2361355) (← links)
- A competitive analysis for balanced transactional memory workloads (Q2429336) (← links)
- Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency (Q2441506) (← links)
- Incremental medians via online bidding (Q2482726) (← links)
- Utilization of nonclairvoyant online schedules (Q2508980) (← links)
- Approximating total flow time on parallel machines (Q2641865) (← links)
- An Optimal Strategy for Online Non-uniform Length Order Scheduling (Q3511440) (← links)
- Minimizing Average Flow-Time (Q3644722) (← links)
- Non-Clairvoyant Precedence Constrained Scheduling. (Q5091220) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- Achievable Performance of Blind Policies in Heavy Traffic (Q5219677) (← links)
- (Q5743473) (← links)
