We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 6
Difference between strong and weak
semaphore
Strong Semaphores: unblock the longest waiting process and
guarantee freedom from starvation.
Strong Semaphores: maintains FIFO queue
Weak Semaphores: unblock without regard to order
Weak Semaphores: maintains no guaranteed order of the queueMUTE
VERSUS
SEMAPHORE
WU LGN Msp,
A program object that
allows multiple processes
to take turns to share the
same resource
Locking mechanism
errr
An object
Ory
No categorization
Teer)
If the mutex is locked, the
process that requests the
lock waits until the system
releases the lock
Peer
Process uses acquire() and
release() to access and
Br [aay enna
SEMAPHORE
A variable that is used to
control access to a common
resource by multiple
Yael tie ercmoey Cee ces TE
PSs Cota Cele eer
multitasking operating
Scat
eames
Signaling mechanism
Peer
An integer variable
Perey
ategorized as binary and
counting semaphores
If the semaphore value is
Q, the process perform
wait() operation until the
semaphore becomes
greater than 0
Bets e mur Omen sett O)
omnes
Ma Raa a vee). West)Itdivicks the physical memory into | @ divides the Computer's physical
frames and program's address | memory and program's address
2 inte same sire pages. yoace ints seg
The size of the page is specified by | The-sire of the segment is.specified
the bardware, ery The ier,
Ie enany head bo ingfercal Bomay lead to External
fragmentation as the page Is of fragmentation as the memory Is
Pagid Eick size. filed with the variable sizod.
blinks.
with frames from B ‘with plytical memory.
Page table contains paye number Segment table contains segment
and Trame eumber, eumber, length of segment and
base address of segment from
Paging consist of Static linking & | Sagment comist of Dynamic
@ynamic keading Uniting & Gynamic Loading
A page bs of physical unit A page Is of logical unitat 11:20
Answer:
Sr, No.
1
vo) 0.50 <>
tre Kile
Following are the differences between multiprocessy and
multiprogramming.
Multiprocessing
Multiprocessing refers to
processing of multiple
processes at same time by
multiple CPUs.
It utilizes multiple CPUs.
It permits parallel
Processing.
Less time taken to process
the jobs.
It facilitates much efficient
utilization of devices of the
computer system.
‘Usually more expensive.
Multiprogramming
Multiprogramming keeps several
programs in main memory at the same
time and execute them concurrently
utilizing single CPU.
It utilizes single CPU,
Context switching takes place.
More Time taken to process the jobs.
Less efficient than multiprocessing.
Such systems are less expensive.USER LEVEL THREAD
User thread are implemented by users.
OS doesn't recognized user level threads.
Implementation of User threads is easy,
Context switch time is less.
Context switch requires no hardware
‘support.
If one user level thread perform blocking
‘operation then entire process will be
blocked.
Example : Java thread, POSIX threads.
KERNEL LEVEL THREAD
kernel threads are implemented by OS
Kernel threads are recognized by OS.
Implementation of Kernel thread is
complicated.
Context switch time is more.
Hardware support is needed.
If one kernel thread perform blocking
operation then another thread can continue
execution,
Example : Window Solaris.Parameter
Definition
Lightweight
Termination time
Creation time
Communication
Context switching
time
Resource
Treatment by OS
Memory
Sharing
Process
Process means a program is in execution.
The processis not Lightweight.
The process takes more time to terminate.
It takes more time for creation.
Communication between processes needs
more time compared to thread.
Ittakes more time for context switching.
Process consume more resources.
Different process are tread separately by
Os.
The processis mostly isolated.
It does not share data
Thread
Thread means a segment of a process.
Threads are Lightweight.
The thread takes less time to terminate.
It takes less time for creation.
Communication between threads requires
less time compared to processes.
It takes less time for context switching.
Thread consume fewer resources.
All the level peer threads are treated asa
single task by OS.
Threads share memory.
Threads share data with each other.