Beefy Boxes and Bandwidth Generously Provided by pair Networks RobOMonk
Problems? Is your data what you think it is?
 
PerlMonks  

Re^2: dynamic number of threads based on CPU utilization

by BrowserUk (Pope)
on Sep 26, 2012 at 15:59 UTC ( #995803=note: print w/ replies, xml ) Need Help??


in reply to Re: dynamic number of threads based on CPU utilization
in thread dynamic number of threads based on CPU utilization

Remember, the work being done here is I/O-bound, not CPU bound.

Why are you doing this?

For 90%+ of the runtime of the OPs program, IT IS CPU BOUND NOT IO BOUND.

So do just stop regurgitating your useless, pointless, irrelevant, and gratuitously incorrect home-spun wisdoms.


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.

RIP Neil Armstrong


Comment on Re^2: dynamic number of threads based on CPU utilization
Re^3: dynamic number of threads based on CPU utilization
by mabossert (Sexton) on Sep 26, 2012 at 16:38 UTC

    my apologies...I thought that since the procXml sub worked just fine, it would not be relevant to the discussion or potential solution. Within the procXml sub, I simply slurp the file into a hash, then operate on the hash.

    I was under the impression that because I was operating on the file contents in memory (i.e. the hash), it was a mostly CPU-bound process (minus slurping the input file and printing to the output file.

      .I thought that since the procXml sub worked just fine, it would not be relevant to the discussion or potential solution.

      You were mostly right. The only relevance it has is that nowhere in that code do I see any sign of locking (the keyword 'lock' does not appear), which means that multiple threads are writing to a shared hash and there is nothing to prevent them from corrupting data through collisions.

      You may 'get away with it', but I wouldn't want to be responsible for when things go wrong.


      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.

      RIP Neil Armstrong

Re^3: dynamic number of threads based on CPU utilization
by sundialsvc4 (Monsignor) on Sep 26, 2012 at 18:15 UTC

    When a CPU runs in terms of literally billions of ops per second these days, and it is drawing its inputs from a large number of files, then ... it is I/O-bound because that’s what it is waiting on.   Nanoseconds vs. milliseconds.   The completion-time of this program, over the course of let us say one minute, will chiefly be regulated by its ability to perform input/output, not by the speed of the processor(s).   If you were to place the program onto a CPU that ran twice as fast, all other things being equal, such a program would not complete in half the time.   If it truly were CPU-bound, then it would not “slow down,” a-n-d drop out of CPU-utilization at the same time, as it is reported to be doing.

    As you say in the (upvoted) earlier comment, this is a poorly thought-out program from the start.   I would further guess that the hash might well have become enormous by that time, and that quite possibly the program has descended into “thrashing hell.”   Something, and it can only be I/O, is utterly preventing the CPU from getting any work done during the second phase.   Thrashing is about the only culprit that exists to explain that.

      Look you idiot. You are talking crap. SO DO SHUT THE F*** UP!


      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.

      RIP Neil Armstrong

        Don't get personal, sir.   Neither “idiot,” nor “crap,” nor certainly “F***,” is appropriate language to use in this Monastery.   Addressed to anyone.   For any reason.   I will trouble you henceforth to remember that very simple rule of human etiquette.

      What kind of I/O? Mechanical disk I/O? SSD I/O? Ethernet I/O? DRAM I/O? L1 cache I/O?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (14)
As of 2014-04-16 16:19 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    April first is:







    Results (432 votes), past polls