Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Write a note on semaphores
A semaphore is a tool meant for synchronizing multiple processes trying to access a shared variable. That is a semaphore is used to deal with the critical section problem or in other words to evade the race condition. A semaphore S is in fact an integer variable that apart from initialization is accessed only through two standard atomic operations:
*Wait and signal.
The traditional definition of wait in pseudo code is:
wait (S) {
while (S<=0)
; // no-op
S--;
}
The traditional definition of signal in pseudo code is:
signal (S) {
S++;
For each process P,
do {
WAIT
Critical Section
SIGNALS
} while (1);
A semaphore is able to be defined as:
typedef struct {
int value;
struct process *L;
} semphore;
Once more, the wait semaphore operation can be defined as:
void wait (semaphore S) {
S.value--;
if (S.value < 0) {
add this process to S.L;
block();
As well, the signal semaphore operation is able to be defined as:
void signal( semaphore S) {
S.value++;
if (S.value <= 0) {
remove a process P from S.L;
wakeup(P);
What is a Latency Time Latency Time is the time required through a sector to reach below read/write head.
Using pages makes it easier to manage the whole memory, avoiding excessive fragmentation and waste. As an analogy, think of Tetris, but with only square blocks: it is relatively ea
A- In a table format, compare between Programmed I/O, Interrupt -driven I/O, and Direct Memory Access (DMA) in terms of basic idea, Advantages, disadvantages, and the operating en
In a multiprogramming and time sharing environment several users share the system simultaneously .what are two such problems?
What is a thread? A thread or else called a lightweight process (LWP) is a basic unit of CPU utilization, it comprises of a thread id, a program counter, a register set and a s
examples of classification of models
Define buffering. A buffer is a memory area that keeps data whereas they are transferred among two devices or among a device and an application. Buffering is done for three rea
Q. Several CPU-scheduling algorithms are parameterized for instance the RR algorithm requires a parameter to indicate the time slice. Multilevel response queues require parameters
Differentiate between sequential access and direct access method?
What are overlays? To enable a process to be larger than the amount of memory allocated to it, overlays are used. The idea of overlays is to keep in memory only those instructi
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd