1.2.1 - Systems Software Flashcards
What does ‘operating system’ mean?
The term operating system refers to a collection of programs that work together to provide an interface between the user and the computer.
Name four tasks that the operating system does.
Memory management (paging, segmentation, virtual memory); Resource management (scheduling); File management; Input / output management; Interrupt management; Utility software; Security; User interface.
Name the two types of memory management.
Paging and segmentation.
Describe the purpose of memory management.
Computer memory must be shared fairly between multiple programs and applications to ensure the computer doesn’t crash and each application runs properly.
Describe how paging works.
Paging is when memory is split up into equal size sections called pages.
Paging uses physical divisions of memory.
Describe how segmentation works.
Segmentation is the process of splitting up memory into segments of varying size.
Segmentation uses logical memory divisions.
What is meant by ‘virtual memory’?
Virtual memory uses a section of the hard drive to act as RAM when the RAM is insufficient.
What is the main issue with virtual memory?
Virtual memory can cause disk thrashing to occur. This is where the computer freezes as a result of pages being swapped too frequently between the hard disk and main memory.
What is an interrupt?
Interrupts are signals generated by software or hardware to indicate to the processor that a process needs attention.
How are interrupts stored?
Interrupts are stored in order of their priority.
Whose job is it to ensure interrupts are serviced fairly by the processor?
The operating system through interrupt service routines.
How does an interrupt service routine work?
- The processor checks the contents of the interrupt register at the end of each fetch-decode-execute cycle.
- If an interrupt exists that is a higher priority to the process being executed, the current contents of the registers in the CPU are transferred onto the stack.
- The processor then loads the correct interrupt service routine into RAM.
What happens when an ISR has finished?
The contents of the registers are taken from the stack and reloaded into the registers in the CPU. The processor then carries on as normal.
What is scheduling?
Scheduling ensures that all sections of the programs being run receive a fair amount of processing time.
Name the five scheduling algorithms.
Round robin, first come first served, shortest job first, shortest remaining time and multilevel feedback queues.
Describe how the round robin scheduling algorithm works.
Each job is given a section of processor time called a time slice. If the job has not been completed when the time slice has ended, the next job is given a time slice.
Describe how the first come first served scheduling algorithm works.
Jobs are processed in chronological order by which they entered the queue.
Describe how the shortest job first scheduling algorithm works.
The queue storing jobs to be processed is ordered according to the time required for completion, with the longest jobs being serviced at the end.