Explain mutual-exclusion implementation with semaphores, Computer Engineering

Assignment Help:

Disadvantage and Advantage of mutual-exclusion implementation with semaphores.

Disadvantage: Mutual-exclusion solutions specified by semaphores require busy waiting.

That is, even as a process is in its critical section, any other process which tries to enter its critical section should loop continuously in the entry code. Therefore, busy waiting wastes CPU cycles that several other process might capable to use productively.

Advantage: This kind of semaphore is also termed as spinlock as the process "spins" while waiting for lock. Spinlocks are helpful in multiprocessor systems as no context switch is needed when a process should wait on a lock. Therefore, when locks are expected to be held for short times, spinlocks are helpful.


Related Discussions:- Explain mutual-exclusion implementation with semaphores

Explain wait for graph-resource request and allocation graph, Explain Wait ...

Explain Wait for graph (WFG) with Resource request and allocation graph (RRAG). WFG with RRAG: A graph G = (V,E) is termed as bipartite if V can be decomposed in two

Explain about parallel programming environment, Q. Explain about parallel p...

Q. Explain about parallel programming environment? The parallel programming environment comprises of a debugger, an editor, performance evaluator, programme visualizer for incr

Where the grade of service is measured, The grade of service is measured in...

The grade of service is measured in (A) Percentage                                  (B)  Number (C)  Fractional Number                    (D)  Logarithmic Number  Ans

Explain about programmable logic array, Q. Explain about Programmable Logic...

Q. Explain about Programmable Logic Array? Until now individual gates are considered as fundamental building blocks from that different logic functions can be derived. With the

Why process scheduling algorithm favour i/o bound processes, Suppose that a...

Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes,

Explain the concept of top-down design for a program, Explain the concept o...

Explain the concept of top-down design for a program. Top down Design: A top-down approach is fundamentally breaking down a system to gain insight into its compositional s

Determine about the logical shift, Logical shift A logical shift operat...

Logical shift A logical shift operation transfers 0 through serial input. We apply symbols shl and shr for logical shift left and shift right microoperations, examples:. R1

Recursion to an iterative procedure, The data structure required to convert...

The data structure required to convert a recursion to an iterative procedure is  Stack is the data structure required to convert a recursion to an iterative procedure

Building is into our operational processes, Building IS into our operationa...

Building IS into our operational processes - Information System Although information systems are becoming increasingly prevalent they are not always the correct solution to ev

What are latches and flipflops, What are latches and flipflops? There a...

What are latches and flipflops? There are two types of circuits as follows: a. Combinational b. Sequential Flipflops and latches both come into the category of "sequen

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