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

Define object oriented modelling, Object oriented modelling Object ori...

Object oriented modelling Object oriented modelling is entirely a new way of thinking about queries. This methodology is all about visualizing the things by using models organ

What are the graphics adapters, Graphics adapters: Video card converts...

Graphics adapters: Video card converts digital output from computer into an analog video signal and transmits the signal through a cable to monitor also known as a graphics ca

Explain Not recently used page replacement algorithm, Not Recently Used Pag...

Not Recently Used Page Replacement Algorithm The not recently used abbreviated as NRU page replacement algorithm works on the subsequent principle: while a page is referenced,

Explain about zip drive, Q. Explain about Zip Drive? Zip Drive: Loads...

Q. Explain about Zip Drive? Zip Drive: Loads of files, Volumes of data have definitely increased onus on today's computer user and protection of this data is what bugs every

Explain the term step-wise refinement, Explain the term step-wise refinemen...

Explain the term step-wise refinement. Ans:  Step Wise Refinement  Refinement is a method of elaboration. Here one starts with a statement of function that is described a

Define variants of turing machine, Define variants of Turing Machine?  ...

Define variants of Turing Machine?  Variants are  Non deterministic turing machine.  Mutlitape turing  machine.  Enumerators

Write miss policy - cache memories, WRITE MISS POLICY:   Write allo...

WRITE MISS POLICY:   Write allocate   fetch on write   fetch entire block, then write word into block   allocate a new block on each writ   allocate block, but

Explain the term control dependence, Control Dependence Segments or I...

Control Dependence Segments or Instructions in a program can include control structures. So, dependency among statements is able to be in control structures also. However the

Perform on occurrence of an interrupt, Q. Perform on occurrence of an inter...

Q. Perform on occurrence of an interrupt? Determining these requirements let's work out steps that CPU should perform on occurrence of an interrupt. The CPU should find

difference among primary and secondary storage device, In primary storage ...

In primary storage device the storage capacity is fixed. It has a volatile memory. In secondary storage device the storage capacity is not limited. It is a nonvolatile memory. Prim

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