Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re^4: Reducing memory usage while matching log entries

by matt.tovey (Beadle)
on Feb 02, 2006 at 09:00 UTC ( #527267=note: print w/replies, xml ) Need Help??

in reply to Re^3: Reducing memory usage while matching log entries
in thread Reducing memory usage while matching log entries

      I like this idea but I'm having trouble get a 2 pass solution to work nicely...

    I don't understand your difficulty...

Sorry, I had to leave work about the time of my last message yesterday (well, actually 10 minutes _before_ my last message!), but didn't want to disappear without writing back. And I'm not good at coding under stress (and not fantastic the rest of the time either!).

Anyway, thanks for taking the time to write out the code there. Strangely enough, I tried it this morning, and the memory usage of this is actually higher than the original, at least as Linux measures it! I'm processing a 65MB test file - after the first pass the script is consuming 100MB of memory, and after the sort then 200MB!
With this test file, @unlock_lines ends up with 800000 entries, but still I was surprised. My original script used (RSS & VSZ) 160MB, and using a hash to store the file in memory (so as to properly free the deleted lines) brings it down to 110MB...

Thanks also for '$.' - I didn't know about that one!

  • Comment on Re^4: Reducing memory usage while matching log entries

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (3)
As of 2023-06-07 09:11 GMT
Find Nodes?
    Voting Booth?
    How often do you go to conferences?

    Results (29 votes). Check out past polls.