Nonclairvoyant scheduling
From MaRDI portal
Publication:1331961
DOI10.1016/0304-3975(94)90151-1zbMath0820.90056OpenAlexW2912168264MaRDI QIDQ1331961
Eric Torng, Rajeev Motwani, Steven J. Phillips
Publication date: 29 August 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90151-1
release timeexecution timeinter-dependence between jobspreemption costpreemptive, nonclairvoyant scheduling schemes
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)
Related Items (33)
The impact of processing order on performance: a taxonomy of semi-FIFO policies ⋮ A survey on makespan minimization in semi-online environments ⋮ Semi-clairvoyant scheduling ⋮ Transactional contention management as a Non-clairvoyant scheduling problem ⋮ Approximating total flow time on parallel machines ⋮ Scheduling search procedures: The wheel of fortune ⋮ Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling ⋮ Window-based greedy contention management for transactional memory: theory and practice ⋮ An Optimal Strategy for Online Non-uniform Length Order Scheduling ⋮ A competitive analysis for balanced transactional memory workloads ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ Speed scaling for stretch plus energy ⋮ Nonclairvoyant speed scaling for flow and energy ⋮ Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency ⋮ Transactional scheduling for read-dominated workloads ⋮ Probabilistic analysis for scheduling with conflicts ⋮ Non-clairvoyant scheduling with conflicts for unit-size jobs ⋮ On the competitiveness of AIMD-TCP within a general network ⋮ Speed scaling of processes with arbitrary speedup curves on a multiprocessor ⋮ Incremental medians via online bidding ⋮ Performance guarantees for hierarchical clustering ⋮ TCP is competitive with resource augmentation ⋮ Utilization of nonclairvoyant online schedules ⋮ Achievable Performance of Blind Policies in Heavy Traffic ⋮ Non-Clairvoyant Precedence Constrained Scheduling. ⋮ Minimizing Average Flow-Time ⋮ Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems ⋮ New algorithms for related machines with temporary jobs. ⋮ Restarts can help in the on-line minimization of the maximum delivery time on a single machine ⋮ Unnamed Item ⋮ Non-clairvoyant weighted flow time scheduling on different multi-processor models ⋮ Online strategies for backups ⋮ Online scheduling FIFO policies with admission and push-out
Cites Work
- An on-line graph coloring algorithm with sublinear performance ratio
- Upper bounds for static resource allocation in a distributed system
- Scheduling with Deadlines and Loss Functions
- Bounds on Multiprocessing Timing Anomalies
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Nonclairvoyant scheduling
