#Process Management //

                               #PROCESS MANAGEMENT#

#PROGRAM & PROCESS

Program is a set of instruction and collection of subroutines . It’s used to provide a flaxiable
interface for the user where other hand process is execution of program for the user .

#PROCESS STATE

A process state is the execution behavior where task are executed for further execution
with comparing program . process may have various stages to perform task . in process
state the possible state are –

: NEW
:READY
:RUNNING
:WAITING (HOLTING)
:TERMINATE

In other word a process state execute in various stages from start to end .

#NEW :-

In new state the program is created for execution from the job queue. The process
management decide new process is to be executed from the several job.

# READY :-

Ready state is a state where new job are confirm to be executed ,this is actually a first
state of process state

# RUNNING :-

In this state process are being executed . it’s just started after ready state .
#WAITING (HOLTING) :-

In this state job is stopped by the process management during running of program .
this state basically preferred when interrupt is called .

# TERMINATE :-

Terminate state is a final state of process state which is consider completion of job this
is called after successful transcation or called operation .

#PROCESS SCHEDULING

A process scheduling is a method of selection of from the process queue . in
multiprogramming invoirment there are multiple task given to computer for
processing ,these all task are substitute into a process manager according to different
scheduling criteria’s . these are –

1. FCFS ( frist come first serve )
2. SJF (shortest job first )
3. RRT ( Round Robin technique )
4. PBT ( Priority based technique )

# GOOD SELECTION PROCEDURE OF PROCESS SCHEDULING

A process manager select a proper scheduling technique which has specific advantage
over better processing management . the selection procedure are made according to ----
---
 :Better throughput
 :Less turn around time
 :Less waiting time
 :Less execution time
 :High performance . etc

(1) FCFS :--

It stand for first come first serve , as name suggested the process manager pick
very first arrival from the job queue . This method do not see time given or assign to the
job , it normally pick one by one job according to arrival .
Scheduling :-j1<j2<j3,j4 (fcfs)

(2 ) SJF :-

It stand for shortest job first , in which the job having least executed very first ,
then it find next another shortest until completion .
Job queue
Scheduling :- j4<j3<j1<j2 (sjf)

(3) PBT :--

Is stand for priority based technique in which process manager put priority to every job
and selection is done according to based on priority .
Scheduling :- j3<j1< j4< j2( pbt).

(4) RRT :--

It’s stand for Round Robin technique , in this scheduling time slice is aimed at
providing fair service to all request . in the RR scheduling each process is scheduled on
the basic of fix time interval or time slice . A process with a burst time smaller than the
time slice left the CPU earlier and the process with burst time higher than the fixed time
slice have to left the CPU after expairing of time slice .

#Types Of Register //

#TYPES OF REGISTER

There are basically four types of shift –register is used according to storage & retrieval these
are .
1. Serial in , Serial out
2. Serial in , Parallel out
3. Parallel in , Serial out
4. Parallel in , Parallel out .

In shift register the data value are shifted in serial types such as right shifting , left shifting ,
parallel In , parallel out etc .
Thedata such as binary information are stored into flip-flop serially or parallel . the
data is shifted from the right or left etc , to hold binary request .

i. Serial in , Serial out : in serial in serial out register the data is feeded into one flipflop
and shifted into another procedure flip- flop , the flip- flop shift the data
value according to clock pulse .
Explanation : binary information 1101 is allowed for storing into a memory need four
bit of register initially all flip – flop is set as clear such as zero (low) which the clock
pulse first bit is retrieve as data in FFA . In second clock pulse another data zero is
retrieve from the sequence and feed into FFA and the value stored in FFA push in FFB
or shifted . The whole process is done by the completion of bit in a sequence .

ii. Serial in , Parallel out : In serial in parallel out shift register the value is feeded into
flip-flop as well as taken separate output .
In serial in parallel output two output is taken at a same time serially and parallel
the main function of serial in parallel out binary series are taken both in stable
format .
In serial out the output is according to sequence to sequence of input .

iii. Parallel in , Serial out : in parallel in serial out the value input is a parallel and
serially organized in such type of register all input in a register are done and
perform the task of serial out , the performance in parallel in serial out is faster
than serial in serial out and serial in parallel out .
Explanation : in parallel in serial out the input provide to all register indivisualy and
perform serially .

iv. Parallel in , Parallel out : in parallel in parallel out the input and output is taken at
the same time .
In this register the information is loaded indivisually to the register and taken
output instantaly in this register there is only one input and one output due to this
its fastest than the all other types of register .

*NOTE : in latest computer parallelly in parallel out shift register basically used .