Log 2:14:55 PM:- Starting process. 2:14:56 PM:- Auction run for Kazzak EU. 2:14:58 PM:- Connected realm id for Kazzak EU is 1305. 2:15:01 PM:- The realm data for Kazzak EU namespace is downloaded. 2:15:42 PM:- We have 0 to add and 95789 auctions to update and 1883 expired or sold auctions in the database for Kazzak EU. 2:15:42 PM:- Saving changes for Kazzak EU. 2:16:13 PM:- Updated 95789 auction listings for Kazzak EU in 10 batches. 2:16:13 PM:- Marking expired auctions for Kazzak EU. 2:16:14 PM:- Getting Kazzak EU done took 1minutes 17 seconds. 2:16:14 PM:- Auction run for Illidan US. 2:16:14 PM:- Connected realm id for Illidan US is 57. ...snip... 2:18:18 PM:- Auctions scan 1 complete.
I took your advice and doubled it. A program that had me baffled this morning is now running perfectly. Many thanks guys! On Thu, 1 Sept 2022 at 16:34, Greg Wooledge <g...@wooledge.org> wrote: > On Thu, Sep 01, 2022 at 03:47:52PM +0300, Patrick Kirk wrote: > > /var/log/messages:Sep 1 12:41:34 debian-s-websites kernel: > > [31104249.962672] .NET ThreadPool invoked oom-killer: > > gfp_mask=0x6280ca(GFP_HIGHUSER_MOVABLE|__GFP_ZERO), nodemask=(null), > > order=0, oom_score_adj=0 > > /var/log/messages:Sep 1 12:41:34 debian-s-websites kernel: > > [31104249.973435] oom_kill_process.cold.30+0xb/0x1cf > > > > Dan - you found my problem. Thanks! > > > > When the program is running I have this: > > Mem: 989Mi 579Mi 64Mi 149Mi 346Mi > > 120Mi > > > > It clearly thinks 64M is not enough. I know my program can require up > to a > > Gig of memory for the bigger datasets. What is the minimum GNU/Linux > will > > tolerate so I don't end up throwing money away on unused RAM? > > You said this is a VPS, so it's going to depend on which *type* of VPS, > but mostly it's a matter of how much memory the VPS is allowed to use, > by the host system. > > It looks like your VPS is limited to 1 GB (989 Mi, it says) of total > memory. If your program is coming close to that, then you may need to > talk to your VPS provider and get more memory allocated to you (which > may cost more money). > > Try doubling it. > >
