Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: Estimating computation time perl scripts

by BrowserUk (Pope)
on Dec 27, 2012 at 13:02 UTC ( #1010523=note: print w/replies, xml ) Need Help??

in reply to Estimating computation time perl scripts

Most every long running program contain repetition in the form of loops, or recursion, or a set of work items to be processed; and the number of repetitions are normally known, or are quickly estimable.

If you time the first repetition and multiply by the known or first estimation of the repetition count, you can approximate the total time and derive a %complete.

As the time taken for each repetition can vary, you can time each successive repetition and adjust the percentage dynamically.

You'll get better/more specific suggestions if you give us more information about the nature of your program.

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: Estimating computation time perl scripts

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1010523]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (5)
As of 2018-05-23 23:28 GMT
Find Nodes?
    Voting Booth?