Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
OS Mod 2
| Question | Answer |
|---|---|
| A program in execution; an active entity that resides in memory. | Process |
| A passive entity, such as the contents of a file stored on disk. | Program |
| The section of a process that contains temporary data such as method/function parameters, return addresses, and local variables. | Stack |
| Memory that is dynamically allocated to a process during its run time. | Heap |
| The memory segment that contains global and static variables. | Data |
| The segment representing the current activity, including the value of the Program Counter and the contents of the processor's registers. | Text |
| The process state when the process is being created. | New |
| The process state when the CPU is executing its instructions. | Running |
| The process state when a process is waiting for some event to occur, such as an I/O completion. | Waiting |
| The process state when a process is waiting for the OS to assign a processor to it. | Ready |
| The process state when the process has finished execution. | Terminated |
| A data block or record containing many pieces of information associated with a specific process, also called a task control block. | Process Control Block (PCB) |
| The piece of information in the PCB that indicates the address of the next instruction to be executed for this process. | Program Counter |
| The task of saving the state of the old process and loading the saved state for the new process when switching the CPU. | Context Switch |
| A process that creates several new sub-processes during the course of execution. | Parent process |
| A phenomenon where if a parent process terminates, all its children must also be terminated by the operating system. | Cascading termination |
| A process whose execution is deterministic, reproducible, and cannot affect or be affected by other processes. | Independent process |
| A process that shares data with other processes and whose results cannot be predicted in advance because it can affect or be affected by other processes. | Cooperating process |
| The amount of work the system accomplishes in a given time interval. | Throughput |
| The queue consisting of all processes in the system, typically as they enter. | Job Queue |
| The queue keeping the processes that are residing in main memory and are ready and waiting to execute. | Ready Queue |
| The scheduler that selects processes from secondary storage and loads them into memory, controlling the degree of multiprogramming. | Long-term scheduler (Job scheduler) |
| The fast scheduler that selects a process from the ready queue and allocates the CPU to it. | Short-term scheduler (CPU scheduler) |
| The scheduler that removes (swaps out) certain processes from memory to secondary storage to lessen the degree of multiprogramming. | Medium-term scheduler |
| A scheduling scheme where a process keeps the CPU until it releases it by terminating or switching to a waiting state, with no interruptions. | Non-preemptive scheduling |
| A scheduling scheme that works by dividing time slots of the CPU to a given process, allowing the OS to interrupt a process. | Preemptive scheduling |
| The scheduling criteria that measures the percentage of time the CPU is busy working. | CPU Utilization |
| The interval from the time of submission of a process to the time of its completion. | Turnaround Time |
| The total amount of time a process spends waiting in the ready queue. | Waiting Time |
| The time from the submission of a request until the system makes the first response. | Response Time |
| The simplest non-preemptive CPU-scheduling algorithm where the process that requests the CPU first gets the CPU first. | First-Come First-Served (FCFS) |
| An algorithm that assigns the CPU to the process that has the smallest next CPU burst. | Shortest Job First (SJF) |
| The preemptive version of the Shortest Job First (SJF) scheduling algorithm. | Shortest Remaining Time First (SRTF) |
| A scheduling algorithm where each process is assigned a priority value, and the CPU is allocated to the highest priority process. | Priority Scheduling |
| A preemptive scheduling algorithm designed specifically for time-sharing systems where the ready queue is treated as a circular queue. | Round-Robin (RR) Scheduling |
| A small unit of time allocated to each process in Round-Robin scheduling before the CPU is preempted. | Time quantum (time slice) |
Created by:
user-1931754