What do you mean by semaphore?, Operating System

Assignment Help:

What do you mean by semaphore? 

Semaphore: A synchronization variable that acquires on positive integer values. Invented by the Dijkstra

  • P (semaphore): an atomic process that waits for semaphore to turn into positive then decrements it by 1.
  • V (semaphore): It is an atomic process that increments semaphore by 1.

The names arrive from the Dutch, verhogen (increment) and proberen (test). Semaphores are elegant and easy and permit the solution of many interesting problems. They do many more than just mutual exclusion.

 


Related Discussions:- What do you mean by semaphore?

Activities of operating system - memory management, Q. What are the three m...

Q. What are the three main activities of an operating system in regard to memory management? Answer: a. Keep follows of which parts of memory are currently being used and

Network operating system and a distributed operating system, Problem: (...

Problem: (a) (i) Explain what a single system image is and how it is related to the concept of a distributed operating system? (ii) What are the main differences between a

Control the access of the three global variables, Give a brief introduction...

Give a brief introduction about the operation of your program and show that you understand the idea behind threads and mutual exclusion variable. Why do we need to use mutual exclu

Microsoft, Discuss the high barriers to entry in the market for PL operatin...

Discuss the high barriers to entry in the market for PL operating systems

Use of the computing hardware, Q. We have stressed the require for an oper...

Q. We have stressed the require for an operating system to make efficient use of the computing hardware. When is it suitable for the operating system to forsake this principle and

Design issues of network operating system, expalin about the design issues ...

expalin about the design issues of network operating system

What are the issues in designing a network, Normal 0 false fa...

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

Deadlock-avoidance algorithm, Regard as a computer system that runs 5000 jo...

Regard as a computer system that runs 5000 jobs per month with no deadlock-prevention or deadlock-avoidance scheme. Deadlocks take place about twice per month and the operator must

Explain chaining to handle collision, Explain Chaining to Handle Collision ...

Explain Chaining to Handle Collision Chaining:  One easy scheme is to chain all collisions in lists attached to the suitable slot. This permits an unlimited number of collision

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