Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re^2: Efficient way to fork processes and keep a running count?

by ikegami (Pope)
on Jan 28, 2010 at 06:04 UTC ( #820097=note: print w/replies, xml ) Need Help??


in reply to Re: Efficient way to fork processes and keep a running count?
in thread Efficient way to fork processes and keep a running count?

You are violently agreeing with the OP. He said the fourth child should be forked after one of the original three had exited, meaning at most three children exist at any given time.
  • Comment on Re^2: Efficient way to fork processes and keep a running count?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (5)
As of 2020-11-25 00:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?