comment on

I'm not sure if I understand your question completely...

... but I once had a problem with a giant hash constantly swapping and solved it by splitting up the hash into a two tier HoH.

If you can organize the upper tier roughly according to the timeline of your process, your system will only swap the necessary lower hashes on demand.

I already described this here, will update the link after I found it.

HTH! :)

update

see Re: Small Hash a Gateway to Large Hash?

Cheers Rolf
_{(addicted to the Perl Programming Language and ☆☆☆☆ :)}

PS: Je suis Charlie!

In reply to Re: write hash to disk after memory limit by LanX
in thread write hash to disk after memory limit by hailholyghost

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


Come for the quick hacks, stay for the epiphanies.
	PerlMonks