Explain a binary semaphore, Computer Engineering

Assignment Help:

Explain a binary semaphore with the help of an example?

An abstract data type (ADT) is a semaphore which defines a nonnegative integer variable that apart from initialization is accessed only by two standard operations i.e.: wait and signal. The typical definition of wait in pseudo code is given as

wait(S){

      while(S<=0)

    ; // not do anything

          S--;

          }

      The classical definitions of signal in pseudocode is signal(S){

          S++;

       }

A  binary  semaphore  is  one  which  only  gets  the  values  0  and  1.  Such semaphores are utilized to implement mutual exclusion.


Related Discussions:- Explain a binary semaphore

Explain binary number system, Explain Binary number system. Ans. Bi...

Explain Binary number system. Ans. Binary Number System The number of system along with base or Radix two is termed as the Binary Number System. To show the number, 0 a

Define the components of a process precedence sequence, Define the componen...

Define the component of a process precedence sequence? Ans. Process name, sequence operator and also concurrency operator components are process precedence sequence.

How control functions help in signalling and control, How different control...

How different control function categories help in signalling and control. Events happening outside the exchange on the line units, trunk junctions and inter exchange signalin

What is common control switching system, What is common control switching s...

What is common control switching system? Explain. Common Control Switching System: It is a functional block diagram of a common control switching system is demonstrated in figu

Determine the concepts of object oriented analysis, Determine the concepts ...

Determine the concepts of Object Oriented Analysis  In OOA the initial focus is on identifying objects from the application domain, after that fitting those procedures around

Define class p, Define class P  The class of all sets L that can be kno...

Define class P  The class of all sets L that can be known in polynomial time by deterministic TM. The class of all decision problems that can be decided in polynomial time.

Describe about managing data tasks?, Data can be handled by using the featu...

Data can be handled by using the features of Import text wizard and export text wizard. Here you can keep the operation for future use. First you should edit the specification name

What is a co-processor, What is a co-processor? What is its use in a typica...

What is a co-processor? What is its use in a typical microprocessor based system. 8087 NDP (numerical data processor) is also called math co-processor which is used in parallel

State about the object oriented analysis, State about the Object oriented a...

State about the Object oriented analysis Object oriented analysis (OOA) is concerned with developing software engineering specifications and requirements that expressed as a s

Explain complete binary tree, Complete Binary tree A complete binary tr...

Complete Binary tree A complete binary tree can be described as a binary tree whose non leaf nodes have nonempty left and right sub tree and all leaves are at the similar level

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd