fcpu utilization is very low in batch time and it remains idle to executen job
according to the instructions for punchcard punchcard workds as a yes no button
like 1 or 0 in binary form
batch can be written in any language like fortran , common laguage like c,c++
batch inloading in os takes time and unloading also
so cpu is idle .
operator can insert batch 2 after completion of batch1 in os
batch operating system is batch of jobs
JOB is the bundle of program ,i/o data , control instructions.
punch cards
paper tape
magnetic tape
Isro ,nasa jobs calculation
ager time e cpu i/o device alada jaygay chilo tai job ke operator diye alada
company te dito data ba job save kre rakhte .
operator is like command ,gui interface in this time
and then after providing punch cards operator makes similar kind of jobs in a batch
and cpu started to execute job , then result niye ashte hoto.
but pore monitor system ashche to shoe the result quickly ...
Multiprogrammed Os
ram e onk process niye asha (multiple process in ram) also in Main Memroy
Non preemptive--
mane cpu ke 1ta program dibo and according to the instruction
cpu kono i/o device er data retrieve krte gele abundance program thakbe jetar
serial wise process 2 cpu te ashbe and otar instructions wise kaj kra start krbe,
so that cpu cant be idle or jate faka na thake . and if cpu te jdi sb instruction
alada interruption ba i/o device er kono instructions na thake then
cpu nije age process 1 complete krbe then process 2 ashbe but jdi emn (i/o device
er kono instructions) thake then process2 kaj kra start krbe .
e kaj kre IDLENESS niye cpu should not be idle .
so ,we cant remove process 1 untill it is completed (drawbacks).
so the idea of multitasking came where it can forcefully remove process1 because of
time scheduling.(time sharing )and start to
execute process 2.
multitasking OS
ekhne pre-emptive kaj hbe mane time sharing , means i will execute a procee within
a time interval then i will go further for another process , if the process is
complete during the time periood then well and good otherwise i will execute it in
future . so cpu er idleness kom and the another advantage is response time kom hoy
quick response ashe .
er main kaj RESPONSIVENESS , quickly response krbe .
time sharing er basis e process futuere e executed hear jnno queue
te jabe ,
it is also known as ------
Fair Share or
Multiprogramming with round robin scheduling..
(Round Robin(RR) algorithm is one of the CPU scheduling that is widely used in
multiprogramming. With this algorithm, the CPU will divide the time for each
process given the same time until the entire process in the queue is complete )
(Fair-share scheduling is a scheduling algorithm for computer operating systems in
which the CPU usage is equally distributed among system users or groups, as opposed
to equal distribution of resources among processes.)
...
basically multiple process running in the same time looks like it
is parallely working but actualy cpu te context switch hoy process according to the
time sharing ..
context switching is so fast which seems like je
process are running at the same time .
OS allocate Cpu to execute one process in a particular time quantum.
cz cpu 1tar besi process run krte pare na , its not possible to run multiple
process at the same time for 1 cpu .
but multiple cpou can do that .. so the multi processing idea came with multiple
cpu ...
Multiprocessing OS
multiple cpu in pc allocates multiple process at the same time
no overloading in the 1 cpu .
it is differnet from multi computer ,
where multiple compiuter hasving their individual cpu itself
and doing their job but multiprocessing is 1 computer having
multiple cores or cpu itself ..
Real time OS
2 types---
soft os and hard os with time bound
in soft , process should be completed within the time bound .
if delays comes here then no critical situation will be occured.
and in hard , process should be completed in the exact time bound. since it is
hard no delays is allowed here .
time bomb, missile launching are hard os
any scientific research time ,
youtube streaming is soft os
Memory mamagement
method of managing primary memory.
cpu execute the instruction
and cpu is dirrectly connected with the cache , register
and ram as a primary memory.
ram is generally (not directly)connected with the secondary memmory .
programs(any programing language execution)
are seating in the secondary memory idly and it is not
connected with cpu directly so according to the instructions
the program or process are taken to the Ram from the secondary memory.
But ram size is low so need to swapping them
this is called the degree of multiprogramming (more and more process in the ram to
time effieciency,cpu utilization
increases by increasing size of Ram ).
multiprogramming - means try to keep the multiple (p1,p2,p3....pn)
process in the ram from the sec memory
so that cpu can execute them .
process has cpu execution and i/o execution.
# od process can be there = ram size / process size which is n
a process takes K time for i/o operations,
Cpu utilizations is =(1-k^n) ......
when the process is doing i/o operartions at the same time
------>increase size of Ram increases cpu utilizations :)
NOW , os takes the responsibity to take the more and more
process from sec memory to Ram and Os functionality increases with the allocationa
nd deallocation with secuirity no interruption of instructions of multiple
process .
......
if a process is not fully need to be executed so whats the need of taking full
process to the ram ?
it causes less efficiency of the cpu utilizations
so an y process can be fractioinized so that the excuting intructions came to ram
and exeute more efficiently.
----this theory lets to know the segmentation and paging or blocking division in
ram .
