1.2.1 system storage Flashcards
os, interrupt, scheduling, types of os, bios, device drivers, virtual machines
what does the operating system refer to?
a collection of programs that work together to provide an interface between the user and computer
what do operating systems allow the user to do?
communicate with the computer and perform certain low level tasks involving the management of computer memory and resources
what does os provide?
memory management
scheduling
file management
i/o management
interrupt management
utility software
security
user interface
what roles do memory management in the os include?
paging, segmentation and virtual memory
what is paging?
when memory is split up into equal sized sections called pages
how does paging work?
programs are being made up of a certain number of equally sized pages they can be swapped between main memory and the hard disk as needed
what is segmentation?
splitting up of memory into logical sized divisions called segments which vary in size
what is the key issue with vm?
disk thrashing
what is disk thrashing?
the computer freezes because of pages being swapped too frequently between hard disk and main memory
what are interrupts?
signals generated by software or hardware to indicate to the processor that a process needs attention
how are interrupts stored?
in order of priority within an abstract data called a priority queue in the interrupt register
when does the CPU check the contents of the interrupt register?
at the end of FDE
what is the ISR?
- if an interrupt in the interrupt register has a higher priority of the process being executed, the contents of the special purpose registers are temporarily transferred into a stack
- the CPU responds to the interrupt by loading the appropriate ISR into RAM
- a flag is set to signal the ISR has begun
- once the interrupt has been serviced, the flag is reset
- the interrupt queue is checked again for further interrupts of a higher priority to the process that was originally being executed
- if there are, it is repeated until they are all serviced
- if there isn’t the contents of the stack are transferred back into the registers in memory
- FDE resumes
what is scheduling?
ensuring that all sections of programs being run (jobs) receive a fair amount of processing time
what are the two types of scheduling algorithms?
preemptive
non preemptive
what is a preemptive scheduling algorithm?
jobs are actively made to start and stop by the OS
what are the preemptive algorithms?
multilevel feedback queues
shortest remaining time
round robin
what is a non preemptive algorithm?
once a job has started it is left alone until its completed
what are the non preemptive algorithms?
first come first served
shortest job first
what is the round robin scheduling algorithm?
- each job is given a section of processor time (time slice) within which it is allowed to execute
- once each job has used its first time slice, the OS grants another time slice to each job
- this is repeated until a job has been completed and then removed from the queue
what are the disadvantages of round robin?
longer jobs will take a much longer time for completing (their execution is inefficiently split up into multiple cycles)
does not take into account job priority
what are the advantages of round robin?
easy to implement and understand (only requires a simple queue and timer)
fair and equitable preventing starvation