answersLogoWhite

0

What are recursive locks?

Updated: 12/7/2022
User Avatar

Wiki User

15y ago

Best Answer

Recursive locks (also called recursive thread

mutex) are those that allow a thread to recursively acquire the same lock that it is

holding. Note that this behavior is different from a normal lock. In the normal case if

a thread that is already holding a normal lock attempts to acquire the same lock again,

then it will deadlock. Recursive locks behave exactly like normal locks when another

thread tries to acquire a lock that is already being held. Note that the recursive lock is

said to be released if and only if the number of times it has been acquired match the

number of times it has been released by the owner thread. Many operating systems do

not provide these recursive locks natively. Hence, it is necessary to emulate the

behavior using primitive features like mutexes (locks) and condition variables.

User Avatar

Wiki User

15y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What are recursive locks?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is recursive association?

a recursive association - as a aggregation is a special form of association, so recursive aggregation can be called as recursive association ... AKASH SISODIYA ......IT ...


Are all recursive programs non recursive?

None of them is, obviously.


What does the word recursive mean?

Something that is recursive is something that repeats.


What is the definition of recursive?

The term recursive refers to the recurrence or repetition.


What is set difference between recursive and recursively enumerable but not recursive?

All recursive Languages are recursively enumerable. But not all the recursively enumerable languages are recursive. It is just like NP complete.


Is 4 9 19 39 79 159 recursive?

no it is not recursive


What does recursive mean?

Recursive refers to using a rule or procedure that can be applied repeatedly.


Why recursive solution is better for tree traversal?

Because a tree is a recursive data-structure. It's easier to write (and easier to understand) a recursive program for handling it.


What is the difference between function and recursive function?

I will explain in the easiest way the difference between the function and recursive function in C language. Simple Answer is argument of the function is differ but in the recursive function it is same:) Explanation: Function int function(int,int)// function declaration main() { int n; ...... ...... n=function(a,b); } int function(int c,int d) { ...... ...... ...... } recursive Function: int recursive(int,int)// recursive Function declaration main() { int n; ..... ..... ..... ..... n=recursive(a,b); } int recursive(int a,int b) { ..... .... .... .... } Carefully see, In the recursive Function the function arguments are same.


What is a recursive relationship?

a function that recalls itself again and again is called recursive relationship.


How can you use recursive in a sentence?

"Computer programs often use recursive subroutines to repeat operations." "The goal recursive model of the Tower of Hanoi was identified by Nowell and Simon."


What is the definition of non recursive in c?

non recursive function is excuted faster than recrussive