Jump to content

Category:Scheduling algorithms

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Dcoetzee (talk | contribs) at 05:56, 4 April 2005 (Basic def). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

These are algorithms designed for scheduling tasks.

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 (24 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=11864149"