UNIT 2: Systems Software Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

What is an OS?

A

-boot loader in ROM loads the OS into RAM when computer is switched on
-OS manages the hardware and provides an interface and the application software

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What functions do the OS provide?

A

-functions it provides- GUI, MEMORY MANAGEMENT, INTERRUPTS and PROCESSOR SCHEDULING

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

OS- User Interface

A

what the user interacts with
hides the complexity of the hardware from the user by providing a UI

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

OS- Memory Management

(Paging, segmentation,VM,)

A

programs and their data needs to be loaded into RAM
OS must manage the allocation of RAM to the different programs
may not be sufficient RM to load all the program at once

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

MM- Paging

A

Available memory is divided into fixed sized chunks called pages
each page has an address
process loads into RAM is allocated sufficient pages- they may not be contiguous in physical terms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

MM- Segmentation

A

Memory can also be divided into segments which can be different lengths
they can relate to parts of a program- for example functions of subroutine may occupy a segment.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

MM- Virtual memory

A

computer has fixed amount of RAM- demand often exceeds this amount
an area of the hard disk can be designated as VM
some pages are stored in VM until they are needed- then swapped into RAM
if many are running- lots of time is spent swapping as there is insufficient RAM

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

VM - DISK THRASHING

A

Repeatedly swapping can noticeably slow down the computer- DISK THRASHING

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

OS- Interrupts

A

Vital CPU can be interrupted when necessary
They can be sent to the CPU by software, hardware devices or CPU internal clock

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

When does the CPU check for interrupts?

A

CPU checks at the end of each clock cycle whether they are any interrupts to be processed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Interrupts EXAMPLES

A

EXAMPLE- printer runs out of paper, error, scheduled interrupt or power failure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Interrupts - using a stack

A

when an interrupt is detected- the processor stops fetching and pushes the current content of its registers into a stack
uses an interrupt service routine

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Interrupts - Priority

A

they have priotires and will be processed in order
interrupts can themselves be interrupted if the new interrupts is of higher priority

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

OS - Processor scheduling

A

single CPU can only process instructions for one application at a time
OS must schedule when each app can use the CPU
gives the illusion of multitasking - appear to be running simultaneously

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Processor scheduling AIMS

A

provide acceptable response times to all users
maximise the time the CPU is usefully engaged
ensure fairness on a multiuser system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

PS Round Robin

A

Each job is allocated(BY FIFO) a time slice during which it can use the CPU
if job ain’t complete by the end of time slice- next job is allocated a time slice

17
Q

What is FIFO? (Round Robin)

A

First in, first out

18
Q

PS First come first served

A

First job that arrives is executed until its complete

19
Q

PS Shortest remaining time

A

time to completion is estimated as each new job arrives
job with SRT is executed, a new shorter job can take over from current process

20
Q

PS Shortest job first

A

also called - shortest process next
total execution time is estimated by the user
waiting job w the smallest total execution time is executed when the current job completes

21
Q

PS Multifeedback queues

A

created w different priority levels
if uses too much CPU time its moved to lower priority
processor can move if waited a long time