Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re: Re: Re: A (memory) poor man's hash

by liz (Monsignor)
on Nov 22, 2003 at 10:29 UTC ( #309145=note: print w/ replies, xml ) Need Help??

in reply to Re: Re: A (memory) poor man's hash
in thread A (memory) poor man's <strike>hash</strike> lookup table.

...(though it will reuse that memory for other things). This is particularly a problem for mod_perl, where the process...

One approach that I always use when a request is going to be quite resource consuming, is to let the child process die after the request is served. You can do this with $r->child_terminate. The extra CPU for forking a new child process is a lot less than the CPU you would lose when the server starts swapping.


Comment on Re: Re: Re: A (memory) poor man's hash

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (6)
As of 2015-11-26 18:34 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (705 votes), past polls