What are Strong Semaphores? What type of Data structure they use to signal process?
A semaphore would be the signalling mechanism type and a thread which is waiting on a semaphore can be signalled by another thread.
It will be using two operations ie., and 1) .wait and 2) . Signal for the process synchronization.
A semaphore is a controlled flag which is used for indicating whether or not a processor is executing a critical section. When the semaphore flag value becomes 0 it means that the shared memory is available to any requesting processor and if it is 1 it means that the memory is not available to other processors
Strong Semaphores is in which all the process will be waiting on the same semaphore which is queued. Strong semaphore will guarantee the freedom from starvation.
A semaphore is used for solving the critical section problem. A
semaphore would follow the policy of first-in-first-out ie., (FIFO)
queue is called strong semaphore. In strong semaphore, processes
will be removed from the Front of queue and will be added into
Rear(tail) of queue i.e. in strong semaphore the process insertion
and deletion will happen on different ends.
Since, strong semaphore will follow the first-in-first-out (FIFO)
policy data structure to handle the multi processing system,
therefore the queue is the best data structure used for the signal
process.
Get Answers For Free
Most questions answered within 1 hours.