Algorithms that decide in what order work is done so that a resource is used well. The elevator algorithm orders requests to a disk or a lift so that the arm sweeps in one direction at a time, run-to-completion scheduling lets each task finish before the next begins, and the driver scheduling problem assigns work to drivers in transport timetables. Each balances fairness, waiting time and the cost of switching between jobs.
Browse By
Scheduling Algorithms
Filter Results11 entries
Sources
Token bucket (Wikipedia)
Has Member: Token bucket, LeadQuote, Has Member: Token bucket, Lead
It can also be used as a scheduling algorithm to determine the timing of transmissions that will comply with the limits set for the bandwidth and burstiness
Critical path method (Wikipedia)
Has Member: Critical path method, Lead sectionQuote, Has Member: Critical path method, Lead section
The critical path method (CPM), or critical path analysis (CPA), is an algorithm for scheduling a set of project activities.
Shortest seek first (Wikipedia)
Has Member: Shortest seek first, Lead paragraphQuote, Has Member: Shortest seek first, Lead paragraph
is a secondary storage scheduling algorithm
Completely fair queueing (Wikipedia)
Has Member: Completely fair queueing, Lead sentenceQuote, Has Member: Completely fair queueing, Lead sentence
Completely Fair Queuing (CFQ) is an I/O scheduler for the Linux kernel which was written in 2003 by Jens Axboe.
Earliest deadline first scheduling (Wikipedia)
Has Member: Earliest deadline first scheduling, Lead paragraphQuote, Has Member: Earliest deadline first scheduling, Lead paragraph
Earliest deadline first (EDF) or least time to go is a dynamic priority scheduling algorithm used in real-time operating systems to place processes in a priority queue.
Weighted fair queueing (Wikipedia)
Has Member: Weighted fair queueing, Lead sectionQuote, Has Member: Weighted fair queueing, Lead section
Weighted fair queueing (WFQ) is a network scheduling algorithm.
Deficit round robin (Wikipedia)
Has Member: Deficit round robin, LeadQuote, Has Member: Deficit round robin, Lead
is a scheduling algorithm for the network scheduler
Round-robin scheduling (Wikipedia)
Has Member: Round-robin scheduling, Lead sectionQuote, Has Member: Round-robin scheduling, Lead section
Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing.
Proportional-fair scheduling (Wikipedia)
Has Member: Proportional-fair scheduling, Lead sectionQuote, Has Member: Proportional-fair scheduling, Lead section
Proportional-fair scheduling is a compromise-based scheduling algorithm.
Elevator algorithm (Wikipedia)
Has Member: Elevator algorithm, LeadQuote, Has Member: Elevator algorithm, Lead
The elevator algorithm, or SCAN, is a disk-scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests.
Driver scheduling problem (Wikipedia)
Has Member: Driver scheduling problem, LeadQuote, Has Member: Driver scheduling problem, Lead
The driver scheduling problem (DSP) is type of problem in operations research and theoretical computer science.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.