Category:Scheduling algorithms

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by imported>Marcocapelle 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)

Jump to navigation Jump to search

Template:Cat main

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

Subcategories

This category has only the following subcategory.

D

Disk scheduling algorithms (9 P)

Script error: No such module "anchor".Pages in category "Scheduling algorithms"

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

C

D

Dynamic priority scheduling

E

F

G

Generalized processor sharing

L

M

Multilevel queue

S

T

Top-nodes algorithm

Retrieved from "http://debianws.lexgopc.com/wiki143/index.php?title=Category:Scheduling_algorithms&oldid=1255707"