OPERATION SYSTEM For each of these 3 components, describe the component’s respon
ID: 3702649 • Letter: O
Question
OPERATION SYSTEM
For each of these 3 components, describe the component’s responsibility and provide an example of an implementation of that component.
In this format:
for example, Within the Memory Management component, separating the capability to translate logical addresses to physical addresses is one separate area of concern. This component is typically a hardware component (the MMU) manufactured to support a very specific architecture, such as the ARM Architecture (page 387) with 4-KB and 16-KB, or 1-MB and 16-MB pages for a 32-bit address. Fixing a bug, or upgrading the address translation algorithm version is confined to the MMU and the OS component, isolating this concern from other parts of the OS.
1. Process Management: Following is the independent, separate concern components of process management: 1) The create, load, execute, suspend, resume, and terminate processes 2) Manage Process Scheduling 3) Process SynchronizationExplanation / Answer
1) CREATE ,LOAD ,EXECUTE ,SUSPEND,RESUME ,TERMINATE PROCESS
process creation :
os creates a process in following situations
starting of a new batch job ; user request for creating new process ; to provide new service by os ; system call from currently running process
process load: when the os creates the process and if it is in the ready queue then it is said to be in ready state and can be loaded for execution
process execute: the process that is first in the ready queue is loaded first and it is executed after reading or writing the required data by the OS
process suspend: the process can be suspended by the os if wait() system call is invoked and if the process requires data that is available only after some time then the OS suspends the process frees the memory
process resume:if a process is suspended due to the unavailability of data object and if the data object is available then the process can be resumed for execution by reloading it from ready queue
process termination:when process finishes its normal execution then that process is terminated.OS delete that process using exit() system call. after deleting process ,memory space becomes free
2) MANGE PROCESS SCHEDULING:
The concept behind process scheduling is CPU utilization is maximum by using multiprogramming concept.processor is not idle ,it is executing a process.processor scheduler selects one process for execution from the ready queue.
The Operating System maintains the following important process scheduling queues ?Job queue ? This queue keeps all the processes in the system.Ready queue ? This queue keeps a set of all processes residing in main memory, ready and waiting to execute. A new process is always put in this queue.Device queues ? The processes which are blocked due to unavailability of an I/O device constitute this queue.the scheduler schedules different processes to be assigned to the CPU based on particular scheduling algorithms. and its of three typer namely short term scheduler ,medium term scheduler,and long term scheduler. gthe algorithms are of two types namely pre-emptive and non pre-emptive and some them are
First Come First Serve (FCFS):Jobs are executed on first come, first serve basis.It is a non-preemptive, pre-emptive scheduling algorithm.
Priority Based Scheduling:Priority scheduling is a non-preemptive algorithm and one of the most common scheduling algorithms in batch systems.Each process is assigned a priority. Process with highest priority is to be executed first and so on.Processes with same priority are executed on first come first served basis.
Shortest Job Next (SJN):This is also known as shortest job first, or SJFThis is a non-preemptive, pre-emptive scheduling algorithm.Best approach to minimize waiting time.
3)PROCESS SYNCHORNIZTION:
logical control flows are concureent if they overlap in time.this general phenomenon is known as concurrency.concurrency refers to any form of interaction among processes or threads.
principles of concurrency :concurrent access to shared data may result in data inconsistency.maintaining data consistency requires mechanisms to ensure he orderly execution of cooperating processes.the cooperating processes share the logical address space .concurrency is possible without parallelism.
RACE CONDITION:
race condition occurs when tow or more operations occur in an undefined manner.when two or more processes are reading or writing some shared data and the final result depends in who runs precisely when , are called race condition
CRITICAL SECTION PROBLEM:
a critical section is a block of code that only one process at a time can execute;so when one process is in its critical section ,no other process may be in its critical section. the critical section problem is to ensure that only one process at a time is allowed to be operating in its critical section.
solution of critical section: solution tto critical problem must satisy the mutual section,progress and bounded waiting parameters.
requirements of mutual exclusion: at any time ,only one process is allowed to enter in its critical section.solution is implemented purely in software on a machine. a process cannot prevent other process for entering into critical section
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.