Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re^10: OT How fast a cpu to overwhelm Time::HiRes

by tirwhan (Abbot)
on Dec 01, 2005 at 15:45 UTC ( #513308=note: print w/replies, xml ) Need Help??

in reply to Re^9: OT How fast a cpu to overwhelm Time::HiRes
in thread OT How fast a cpu to overwhelm Time::HiRes

Ah, right, that would be it. Here are the numbers for 100 concurrent processes with fork (the thread measurement above was done with 100 threads).

Xeon AMD64 single process, empty loop 500,000/s 220,000/s two processes, empty loop 340,000/s 185,000/s single process, gettimeofday 235,000/s 85,000/s two processes, gettimeofday 190,000/s 80,000/s

Still better than threads for the SMP system, not as good for the single-processor one. Which is as expected, so nothing to see here ;-).

Debugging is twice as hard as writing the code in the first place. Therefore, if you write the code as cleverly as possible, you are, by definition, not smart enough to debug it. -- Brian W. Kernighan

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (4)
As of 2018-11-13 06:50 GMT
Find Nodes?
    Voting Booth?
    My code is most likely broken because:

    Results (150 votes). Check out past polls.