Scheduling algorithms

Descripción

AS level Computing Fichas sobre Scheduling algorithms, creado por Toby Woodhead el 08/05/2017.
Toby Woodhead
Fichas por Toby Woodhead, actualizado hace más de 1 año
Toby Woodhead
Creado por Toby Woodhead hace alrededor de 7 años
9
0

Resumen del Recurso

Pregunta Respuesta
Round Robin Each process is given a fixed time to execute.
First come first served The first process to arrive is the first executed.
Multi-level feedback queues Make use of existing algorithms. Each queue can have its own scheduling algorithm.
Shortest job first Executes the job that takes the least time first.
Shortest remaining time Processor is allocated the job that has the least time to complete. Can be preempted by a newer job that has less time to complete.
Mostrar resumen completo Ocultar resumen completo

Similar

A level Computing Quiz
Zacchaeus Snape
Types and Components of Computer Systems
Jess Peason
Input Devices
Jess Peason
Output Devices
Jess Peason
Computing
Kwame Oteng-Adusei
Pack of playing cards answer
Karl Taylor
Code Challenge Flow Chart
Charlotte Hilton
Computer Systems
lisawinkler10
Computer science quiz
Ryan Barton
Computing Hardware - CPU and Memory
ollietablet123
GCSE Computing - 4 - Representation of data in computer systems
lilymate