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

Write an algorithm to outline the macro-expansion, Write an algorithm to ou...

Write an algorithm to outline the macro-expansion using macro-expansion counter. The flow of control throughout macro expansion can be implemented by using a MEC that is macro-

Explain the advantages of object oriented analysis design, Advantages of Ob...

Advantages of Object oriented analysis design The OO approach inherently makes every object a standalone component which can be reused within specific stat problem domains we

Demonstration of a micro controller system, Within the Microelectronics cen...

Within the Microelectronics centre we support the following microcontrollers 68HC11, 80C51 and the PIC16C5xx series; we have a set of software tools and emulators to help debug hig

Double negation, Double Negation : All parents are forever correcting ...

Double Negation : All parents are forever correcting their children for the find of double negatives,  there we have to be very alert with them in natural language like: "He d

What is pci bus, What is PCI bus? The Peripheral component interconnect...

What is PCI bus? The Peripheral component interconnect(PCI) bus is a standard that handles the functions found on a processor bus but in a standardized format that is independe

Algorithmic complexity theory, Algorithmic Complexity theory: Moreover...

Algorithmic Complexity theory: Moreover a similar situation occurs in broad to specific ILP systems when the inference rules are deductive thus they specialize. So at some sta

What are the different types of distributing frames, What are the different...

What are the different types of distributing frames used in exchanges? The various distribution frames used in exchange are demonstrated in figure. Every subscriber in a telep

What is the last entry in all bdc tables, What is the last entry in all BDC...

What is the last entry in all BDC tables? In all BDC tables the last entry is to save the data by using the field name BDC_OKCODE and a field value of '/11'.

C program, a c program to implement multiple stack in a single array

a c program to implement multiple stack in a single array

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