We have detected that Javascript is not enabled in your browser. The dynamic nature of our site means that Javascript must be enabled to function properly. Please read our terms and conditions for more information.

Next up

Copy and Edit

Scheduling algorithms

Description

AS level Computing Flashcards on Scheduling algorithms, created by Toby Woodhead on 08/05/2017.

Flashcards by Toby Woodhead, updated more than 1 year ago

	Created by Toby Woodhead about 7 years ago

Resource summary

Question	Answer
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.

Show full summary Hide full summary

Want to create your own Flashcards for free with GoConqr? Learn more.

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

Browse Library