Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re^4: Recursive locks:killer application. Do they have one? (mu)

by BrowserUk (Pope)
on Jul 16, 2013 at 06:13 UTC ( #1044514=note: print w/ replies, xml ) Need Help??


in reply to Re^3: Recursive locks:killer application. Do they have one? (mu)
in thread Recursive locks:killer application. Do they have one?

I find it hard to imagine how "need to count" can have more than the most trivial of impacts on the efficiency of a mutex.

Independent proof Suck it!

You are almost as bad as sundialsvc4; unfortunately, getting enough monks around here to recognise it is going to be an awful lot harder.


With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.


Comment on Re^4: Recursive locks:killer application. Do they have one? (mu)
Re^5: Recursive locks:killer application. Do they have one? (mu)
by tye (Cardinal) on Jul 16, 2013 at 13:49 UTC

    Too bad that your link doesn't actually contradict my point.

    The need to hit the kernel is not "the need to count".

    - tye        

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1044514]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (5)
As of 2015-07-04 19:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (60 votes), past polls