SUBMITTED TO : SUBMITT

ED BY:
LECT: MRS.MANDEEP KOUR rajeev

ROLL NO: A01

SECTION :D3222
DROUP G1

Answer:
Microkernels:-
In the mid-1980,researchers at Carnegie Mellon University
developed an operating system called Mach that modularized kernel using the micr
okernel .Microkernel provide minimal process & memory management to communicatio
n facility between the client program & various services running in user space &
message passing exchange of data between 2 process.microkernel handles message
transfer between threads.microkernel provides more security and reliability.man
y application can be implemented on top of the micro kernel and low level user
processes = restricted access to system resources.
Benefits of microkernel:
-Splitting the operating system up to part become small an managea
ble.
- All servers run as user mode process ,and not in kernel mode ,the
y do not
- have direct access to the hardware.
- Modification addition to the user space do not require modification of t
he kernel andalso if any modification in the kernel is reqired it is comparative
ly easy as microkernel is a smaller kernel.
- Don’t distinguish b/t kernek-level & user-level services,services are mess
age passing.
- New festures added in .
- Provide interprocess communication.
Level addressed management
Ans =2
Symmetric multiprocessing (SMP) ->
Is one in each processor runs an identical copy
of the operating system and these copies communicate with one an other sa neede
d,benefit –that many process can run at once with out decreasing the performance.
In each processor perfroms all task within operating system,means all processors
are peers. imlpementation of ,n-processors areconnected throught a bus .smp des
igns typically have general purpose and connecting logic and share the samerando
m access memory.
Increased throughput- by increasing the number of processors to more work
done in less time.multiple processors cooperate on task,certain amount is incurr
ed in keeping all parts working correctly.only processor can execute at a time,m
eans other process are waiting for the processor.
Reliability-if function can be distributed property among several processor
s.if we have ten processrs and one fail then each of the remaining nine processo
rs can pick up a share of the work of the failed processor
Ans=3
The design of an opersting system ia an important part of making an o
perating system.
System performance- that is a measure if the rate at a system is capablefor doi
ng useful work.
Hardware failure.
Lack of knowledge of available resources.
Deadlocks arise when two or more processes are allowed to proceed to the point e
ach reaches a situation where it is waiting for some action by one of the other
processes.
A system we can have a set of preconceived ideas as to which aspectrs of the de
signand parts of the coding.
Infinite size of individual memory location in mind.
Ans =5(a)->
A process that is suspended is being swapped to hard disk and is not immediately
available for execution.
• The OS then brings in another process from the suspended queue, or it honors a n
ew-process request.
• blocked, suspend state
– The process has been swapped out (of main memory), and it is still blocked, wait
ing for an event to occur.
• ready, suspend state
– The process was suspended, but the event it had been waiting for has occurred.
– It is available for execution as soon as it is loaded into main memory.
The information of suspended processes must still be kept in the OS process list
• Reasons for process suspension
– Swapping: The OS needs to release sufficient main memory to bring in a process t
hat is ready to execute.
– Other OS reason: The OS may suspend a background or utility process or a process
that is suspected of causing a problem.
– Interactive user request: A user may wish to suspend execution of a program for
purposes of debugging or in connection with the use of resources.
– Timing: A process may be executed periodically and may be suspended while waitin
g for the next time interval.
Parent process request: A parent process may wish to suspend execution of a desc
endant to examine or modify the suspended process or to coordinate the activity
of various descendants.
(b)-> A process switch may occur any time that the OS has gained control from t
he currently running process.
– interrupts (asynchronous)
• caused by external events independent of the running process, e.g.
• I/O devices, clock time-out, memory page fault (only the needed page is not in m
ain memory, not illegal access)
• The execution is first transferred to an interrupt handler, and then to the OS.
• Except for an external termination by the parent, the process is still “alive”.
– traps (synchronous)
• error or exception condition, e.g.,
• arithmetic overflow, illegal access/segmentation fault, etc.
• The OS determines whether the error is fatal. The OS tries to recover from nonf
atal exceptions and resume the currently running process.
A process switch may occur any time that the operating system has gained contro
l from the currently running process. Considering that the system interrupts, th
ere are two types of system interrupts out of which one is simply referred to as
an interrupt and the other as a trap.
The former is caused by some sort of event that is external to and independent o
f the currently running process, such as the completion of an I/O operation. The
latter relates to an error or exception condition generated within the currentl
y running process, such as an illegal attempt to access a file.
The operating system determines whether the currently running process has been e
xecuting for the maximum allowed time slice. If so, this process must be switche
d to a ready state and another process dispatched. This is known as clock interr
upt. The operating system determines exactly what I/O action has occurred. If th
e I/O action constitutes an event for which one or more processes are waiting, t
hen the operating system moves all the corresponding blocked processes to the Re
ady state.
The operating system must then decide whether to resume execution of the process
currently in the Running state to preempt that process for a higher-priority Re
ady process.

Ans=6(a)->
There are more process submitted than can be executed immedia
tely.these processes are spooled to a mass storage device,they are kept for late
r executing.the long term scheduler select processes from this pool and loads in
to memory for executing.The long term scheduler executes much less frequently, m
inutes may separate the creation of one new process and next.The long term sched
uler controls the degree of multiprogramming.If is important,the long term sched
uler makes a careful selection.most processes can be described as either i/o bou
nd or cpu bound.The long term scheduler is usually invoked a completed process e
xit the system.it is generally much lower than for the other two types of schedu
ler.an i/o bound process is one that spend more of its time doing i/o than the t
ime it spends in doing computations.

(b)->the short term scheduler allocate the process among the pool of ready proce
sses resident in memoryThe short term scheduler must be fast because it takes 10
milliseconds to decide to execute a process for 100 milliseconds, then 10/(100+
10) = 9 percent of the CPU is being used (or wasted) simply for scheduling the w
ork.the short term scheduler is also invoked an event occurs that may lead to th
e interruption of the current process or may provide an opportunity to preempt t
he currently running process in favour of another.
-clock interrupt.
-interrupts and i/o completions.
-os calls.
-sending and receiving of signals.
-activation of interative programs.
The best performance will have a combination of CPU bound and I/O bound processe
s