Jump to content

Category:Scheduling algorithms

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Marcocapelle (talk | contribs) at 10:30, 10 December 2016 (removed Category:Queueing theory using HotCat). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Algorithms for scheduling tasks and processes by process schedulers and network packets by network schedulers in computing and communications systems.

Subcategories

This category has the following 4 subcategories, out of 4 total.

D

Disk scheduling algorithms (9 P)

N

Network scheduling algorithms (26 P)

O

Optimal scheduling (23 P)

P

Processor scheduling algorithms (1 C, 34 P)

Pages in category "Scheduling algorithms"

The following 19 pages are in this category, out of 19 total. This list may not reflect recent changes.

C

D

E

F

G

H

Heterogeneous earliest finish time

L

M

Multilevel queue

S

T

Top-nodes algorithm

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Scheduling_algorithms&oldid=754010757"