login
Search
Hi The /dev/mem_notify is low memory notification device. it can avoid swappness and oom by cooperationg with the user process. the Linux Today article is very nice description. (great works by Jake Edge) http://www.linuxworld.com/news/2008/020508-kernel.html <quoted> When memory gets tight, it is quite possible that applications have memory allocated—often caches for better performance—that they could free. After all, it is generally better to lose some performance than to face the consequences of being chosen by the OOM killer. But, currently, there is no way for a process to know that the kernel is feeling memory pressure. The patch provides a way for interested programs to monitor the /dev/mem_notify file to be notified if memory starts to run low. </quoted> You need not be annoyed by OOM any longer :) please any comments! patch list [1/8] introduce poll_wait_exclusive() new API [2/8] introduce wake_up_locked_nr() new API [3/8] introduce /dev/mem_notify new device (the core of this patch series) [4/8] memory_pressure_notify() caller [5/8] add new mem_notify field to /proc/zoneinfo [6/8] (optional) fixed incorrect shrink_zone [7/8] ignore very small zone for prevent incorrect low mem notify. [8/8] support fasync feature related discussion: -------------------------------------------------------------- LKML OOM notifications requirement discussion http://www.gossamer-threads.com/lists/linux/kernel/832802?nohighlight=1#832802 OOM notifications patch [Marcelo Tosatti] http://marc.info/?l=linux-kernel&m=119273914027743&w=2 mem notifications v3 [Marcelo Tosatti] http://marc.info/?l=linux-mm&m=119852828327044&w=2 Thrashing notification patch [Daniel Spang] http://marc.info/?l=linux-mm&m=119427416315676&w=2 mem notification v4 http://marc.info/?l=linux-mm&m=120035840523718&w=2 mem notification v5 ...
Yo, Interesting patch series (I am being yuppie and reading this thread from my iPhone on a treadmill at the gym - so further comments later). I think that this is broadly along the lines that I was thinking, but this should be an RFC only patch series for now. Some initial questions: Where is the netlink interface? Polling an FD is so last century :) What testing have you done? Still, it is good to start with some code - eventually we might just have a full reservation API created. Rik and I and others have bounced ideas around for a while and I hope we can pitch in. I will play with these patches later. Jon. On Feb 9, 2008, at 10:19, "KOSAKI Motohiro" <kosaki.motohiro@jp.fujitsu.com --
Thank you. to be honest, I don't know anyone use netlink and why hope receive low memory notify by netlink. poll() is old way, but it works good enough. and, netlink have a bit weak point. end up, netlink philosophy is read/write model. I afraid to many low-mem message queued in netlink buffer at under heavy pressure. Great. Welcome to any idea and any discussion. --
On Sun, 10 Feb 2008 01:33:49 +0900 More importantly, all gtk+ programs, as well as most databases and other system daemons have a poll() loop as their main loop. A file descriptor fits that main loop perfectly. -- All rights reversed. --
not only gtk+, may be all modern GUI program :) --
Just for future reference...the above-mentioned article is from LWN, syndicated onto LinuxWorld. It has, so far as I know, never been near Linux Today. Glad you liked it, though :) Thanks, jon --
Oops, sorry. I had serious misunderstand ;-) sorry, again. and thank you for your helpful message. --
I just noticed this patchset, kosaki-san. It looks quite interesting;
my apologies for not commenting earlier.
I see mention somewhere that mem_notify is of particular interest to
embedded systems.
I have what seems, intuitively, a similar problem at the opposite
end of the world, on big-honkin NUMA boxes (hundreds or thousands of
CPUs, terabytes of main memory.) The problem there is often best
resolved if we can kill the offending task, rather than shrink its
memory footprint. The situation is that several compute intensive
multi-threaded jobs are running, each in their own dedicated cpuset.
If one of these jobs tries to use more memory than is available in
its cpuset, then
(1) we quickly loose any hope of that job continuing at the excellent
performance needed of it, and
(2) we rapidly get increased risk of that job starting to swap and
unintentionally impact shared resources (kernel locks, disk
channels, disk heads).
So we like to identify such jobs as soon as they begin to swap,
and kill them very very quickly (before the direct reclaim code
in mm/vmscan.c can push more than a few pages to the swap device.)
For a much earlier, unsuccessful, attempt to accomplish this, see:
[Patch] cpusets policy kill no swap
http://lkml.org/lkml/2005/3/19/148
Now, it may well be that we are too far apart to share any part of
a solution; one seldom uses the same technology to build a Tour de
France bicycle as one uses to build a Lockheed C-5A Galaxy heavy
cargo transport.
One clear difference is the policy of what action we desire to take
when under memory pressure: do we invite user space to free memory so
as to avoid the wrath of the oom killer, or do we go to the opposite
extreme, seeking a nearly instantant killing, faster than the oom
killer can even begin its search for a victim.
Another clear difference is the use of cpusets, which are a major and
vital part of administering the big NUMA boxes, and I presume are not
even compiled into ...Hi Paul, Thank you for wonderful interestings comment. your comment is really nice. I was HPC guy with large NUMA box at past. I promise i don't ignroe hpc user. but unfortunately I didn't have experience of use CPUSET because at that point, it was under development yet. I hope discuss you that CPUSET usage case and mem_notify requirement. you think kill the process just after swap, right? but unfortunately, almost user hope receive notification before swap ;-) because avoid swap. Hmm, sorry I understand your patch yet, because I don't know CPUSET so much. Yes, some embedded distribution(i.e. monta vista) distribute as source. but embedded people strongly dislike bloat code size. I think they never turn on CPUSET. I think you talk about user space oom manager. it and many user process are obviously different. I doubt memory manager daemon model doesn't works on desktop and typical server. thus, current implementaion optimize to no manager environment. of course, it doesn't mean i refuse add to code for oom manager. it is very interesting idea. Excellent! that is really good idea. Hmmm, I don't think so. I think timing of memmory_pressure_notify(1) is already best. the page move active list to inactive list indicate swap I/O happen a bit after. but memmory_pressure_notify(0) is a bit messy. Disagreed. that is too late. that makes sense. I will learn cpuset and think integrate mem_notify and cpuset. and, Please don't think I reject your idea. your proposal is large different of past our discussion and i don't know cpuset. I think we can't drop all current design and accept your idea all, may be. but we may be able to accept partial until hpc guys content enough. I will learn to CPUSET more in a few days. after it, we can discussion more. please wait for a while. Thanks! --
There is not much my customers HPC jobs can do with notification before
swap. Their jobs either have the main memory they need to perform the
requested calculations with the desired performance, or their job is
useless and should be killed. Unlike the applications you describe,
my customers jobs have no way, once running, to adapt to less memory.
They can only adapt to less memory by being restarted with a different
set of resource requests to the job scheduler (the application that
manages job requests, assigns them CPU, memory and other resources,
and monitors, starts, stops and pauses jobs.)
The primary difficulty my HPC customers have is killing such jobs fast
enough, before a bad job (one that attempts to use more memory than it
signed up for) can harm the performance of other users and the rest of
the system.
I don't mind if a pages are slowly or occassionally written to swap;
but as soon as the task wants to reclaim big chunks of memory by
writing thousands of pages at once to swap, it must die, and die
Yes - understood and agreed - as I guessed, cpusets are not configured
Yes - I agree that my ideas were quite different. Please don't
hesitate to reject every one of them, like a Samurai slicing through
For your work, yes that hook is too late. Agreed.
Depending on what we're trying to do:
1) warn applications of swap coming soon (your case),
2) show how close we are to swapping,
3) show how much swap has happened already,
4) kill instantly if try to swap (my hpc case),
5) measure file i/o caused by memory pressure, or
6) perhaps other goals,
we will need to hook different places in the kernel.
It may well be that your hooks for embedded are simply in different
places than my hooks for HPC. If so, that's fine.
I look forward to your further thoughts.
--
I won't rest till it's the best ...
Programmer, Linux Scalability
Paul Jackson <pj@sgi.com> 1.940.382.4214
--
On Tue, 19 Feb 2008 09:00:08 -0600 Don't forget the "hooks for desktop" :) Basically in all situations, the kernel needs to warn at the same point in time: when the system is about to run out of RAM for anonymous pages. In the desktop case, that leads to swapping (and programs can free memory). In the embedded case, it leads to OOM (and a management program can kill or restart something else, or a program can restart itself). In the HPC case, it leads to swapping (and a management program can kill or restart something else). I do not see the kernel side being different between these situations, only userspace reacts differently in the different scenarios. Am I overlooking something? -- All Rights Reversed --
Thanks for stopping by ... Perhaps with the cgroup based memory controller in progress, or with other work I'm overlooking, this is or will no longer be a problem, but on 2.6.16 kernels (the latest ones I have in major production HPC use) this is not sufficient. As of at least that point, we don't (didn't ?) have sufficiently accurate numbers of when we were "about to run out". We can only detect when "we just did run out", as evidenced by entering the direct reclaim code, or as by slightly later events such as starting to push Anon pages to the swap device from direct reclaim. Actually, even the point that we enter direct reclaim, near the bottom of __alloc_pages(), isn't adequate either, as we could be there because some thread in that cpuset is trying to write out a results file that is larger than that cpusets memory. In that case, we really don't want to kill the job ... it just needs to be (and routinely is) throttled back to disk speeds as it completes the write out of dirty file system pages. So the first clear spot that we -know- serious swapping is commencing is where the direct reclaim code calls a writepage op with an Anon page. At that point, having a management program intervene is entirely too late. Even having the task at that instant, inline, tag itself with a SIGKILL, as it queues that first Anon page to a swap device, is too late. The direct reclaim code can loop, pushing hundreds or thousand of pages, on big memory systems, to the swapper, in the current reclaim loop, before it pops the stack far enough back to even notice that it has a SIGKILL pending on it. The suppression of pushing pages to the swapper has to happen right there, inline in some mm/vmscan.c code, as part of the direct reclaim loops. (Hopefully I said something stupid in that last paragraph, and you will be able to correct it ... it sure would be useful ;). A year or two ago, I added the 'memory_pressure' per-cpuset meter to Linux, in an effort to realize just what you ...
I'm forgetting an important detail here. Kosaki-san has clearly stated
that this hook, at vmscan's writepage, is too late for his embedded needs,
and that they need the feedback a bit earlier, when the page moves from
the active list to the inactive list.
However, except for the placement of such hooks in three or four
places, rather than just one, it may well be (if cpusets could be
factored out) that one mechanism would meet all needs ... except for
that pesky HPC need for throttling to more or less zero the swapping
from select cpusets.
--
I won't rest till it's the best ...
Programmer, Linux Scalability
Paul Jackson <pj@sgi.com> 1.940.382.4214
--
Sounds like a job for memory limits (ulimit?), not for OOM notification, right? Pavel -- (english) http://www.livejournal.com/~pavelmachek (cesky, pictures) http://atrey.karlin.mff.cuni.cz/~pavel/picture/horses/blog.html --
Er eh -- which one?
The only one I see that might help keep a multi-threaded job
using various kinds of memory on multiple nodes confined could
be the resident set size (RLIMIT_RSS; ulimit -m). So far as
I can tell, that one is a pure no-op in Linux.
Here's the bash list of all available ulimit (setrlimit) options:
-a All current limits are reported
-c The maximum size of core files created
-d The maximum size of a process's data segment
-e The maximum scheduling priority ("nice")
-f The maximum size of files written by the shell and its children
-i The maximum number of pending signals
-l The maximum size that may be locked into memory
-m The maximum resident set size
-n The maximum number of open file descriptors (most systems do not allow this value to be set)
-p The pipe size in 512-byte blocks (this may not be set)
-q The maximum number of bytes in POSIX message queues
-r The maximum real-time scheduling priority
-s The maximum stack size
-t The maximum amount of cpu time in seconds
-u The maximum number of processes available to a single user
-v The maximum amount of virtual memory available to the shell
-x The maximum number of file locks
Did I miss seeing one that would be useful?
Actually, given the chronic problem we've had over the years accounting
for how much memory in total (including text, data, stack, mapped
files, locked pages, kernel memory structures that an application is
using many of, ... I'd be suprised if any such ulimit existed that
actually worked for this purpose (confining an HPC jobs to using almost
exactly all the memory available to it, but no more.)
--
I won't rest till it's the best ...
...On Tue, 19 Feb 2008 23:28:28 +0100 I suspect one problem could be that an HPC job scheduling program does not know exactly how much memory each job can take, so it can sometimes end up making a mistake and overcommitting the memory on one HPC node. In that case the user is better off having that job killed and restarted elsewhere, than having all of the jobs on that node crawl to a halt due to swapping. Paul, is this guess correct? :) -- All rights reversed. --
Yes. Fujitsu HPC middleware watching sum of memory consumption of the job and, if over-consumption happened, kill process and remove job schedule. I think that is common hpc requirement. but we watching to user defined memory limit, not swap. Thanks. --
Did those jobs share nodes -- sometimes two or more jobs using the same
nodes? I am sure SGI has such users too, though such job mixes make
the runtimes of specific jobs less obvious, so customers are more
tolerant of variations and some inefficiencies, as they get hidden in
the mix.
In other words, Rik, both yes and no ;). Both sorts of HPC loads
exist, sharing nodes and a dedicated set of nodes for each job.
--
I won't rest till it's the best ...
Programmer, Linux Scalability
Paul Jackson <pj@sgi.com> 1.940.382.4214
--
Hm our dedicated ndoe user set memory limit to machine physical memory size (minus a bit). I think don't have so much share/dedicate and watch user-defined/swap. am i misundestand? --
Not for the loads I focus on. Each job gets exclusive use of its own
dedicated set of nodes, for the duration of the job. With that comes a
quite specific upper limit on how much memory, in total, including node
local kernel data, that job is allowed to use.
One problem with swapping is that nodes aren't entirely isolated.
They share buses, i/o channels, disk arms, kernel data cache lines and
kernel locks with other nodes, running other jobs. A job thrashing
its swap is a drag on the rest of the system.
Another problem with swapping is that it's a waste of resources. Once
a pure compute bound job goes into swapping when it shouldn't, that job
has near zero hope of continuing with the intended performance, as it
has just slowed from main memory speeds to disk speeds, which are
thousands of times slower. Best to get it out of there, immediately.
--
I won't rest till it's the best ...
Programmer, Linux Scalability
Paul Jackson <pj@sgi.com> 1.940.382.4214
--
On Sat, Feb 9, 2008 at 8:19 AM, KOSAKI Motohiro Thanks for this patch set! I ported it to 2.6.23.9 and tried it, on a system with no swap since I'm evaluating this for an embedded system. In practice, the criterion it uses for notifications wasn't sufficient to avoid memory problems, including OOM, in a cyclic allocate/notify/free sequence which is probably typical. I tried it with a real-world program that, among other things, mmaps anonymous pages and touches them at a reasonable speed until it gets notified via /dev/mem_notify, releases most of them with madvise(MADV_DONTNEED), then loops to start the cycle again. What tends to happen is that I do indeed get notifications via /dev/mem_notify when the kernel would like to be swapping, at which point I free memory. But the notifications come at a time when the kernel needs memory, and it gets the memory by discarding some Cached or Mapped memory (I can see these decreasing in /proc/meminfo with each notification). With each mmap/notify/madvise cycle the Cached and Mapped memory gets smaller, until eventually while I'm touching pages the kernel can't find enough memory and will either invoke the OOM killer or return ENOMEM from syscalls. This is precisely the situation I'm trying to avoid by using /dev/mem_notify. The criterion of "notify when the kernel would like to swap" feels correct, but in addition I seem to need something like "notify when cached+mapped+free memory is getting low". I'll need to be looking into doing this, so any comments or ideas are welcome. Thanks, .tom --
Hi Tom, Thank you very useful comment. Could you send your test program? Hmmm, I think this idea is only useful when userland process call madvise(MADV_DONTNEED) periodically. but I hope improve my patch and solve your problem. if you don' mind, please help my testing ;) --
On Wed, Apr 2, 2008 at 12:31 AM, KOSAKI Motohiro Unfortunately, no, it's a Java Virtual Machine (which is a perfect user of /dev/mem_notify since it can garbage collect on notification, among other times). But it should be possible to make a small program with the same Do you have a recommendation for freeing memory? I could maybe use munmap/mmap, but that's not atomic and may be "worse" (more overhead, It's my pleasure to help in any way I can. .tom --
On Wed, Apr 2, 2008 at 12:31 AM, KOSAKI Motohiro
Here's a test program that allocates memory and frees on notification.
It takes an argument which is the number of pages to use; use a
number considerably higher than the amount of memory in the system.
I'm running this on a system without swap. Each time it gets a
notification, it frees memory and writes out the /proc/meminfo
contents. What I see is that Cached gradually decreases, then Mapped
decreases, and eventually the kernel invokes the oom killer. It may
be necessary to tune some of the constants that control the allocation
and free rates and latency; these values work for my system.
#include <stdio.h>
#include <stdlib.h>
#include <sys/mman.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <poll.h>
#include <sched.h>
#include <time.h>
#define PAGESIZE 4096
/* How many pages we've mmap'd. */
static int pages;
/* Pointer to mmap'd memory used as a circular buffer. One thread
touches pages, another thread releases them on notification. */
static char *p;
/* How many pages to touch each 5ms. This makes at most 2000
pages/sec. */
#define TOUCH_CHUNK 10
/* How many pages to free when we're notified. With a 100ms FREE_DELAY,
we can free ~9110 pages/sec, or perhaps only 5*911 = 4555 pages/sec if we're
notified only 5 times/sec. */
#define FREE_CHUNK 911
/* Delay in milliseconds before freeing pages, to simulate latency while finding
pages to free. */
#define FREE_DELAY 100
static void touch(void);
static int release(void *arg);
static void release_pages(void);
static void show_meminfo(void);
/* Stack for the release thread. */
static char stack[8192];
int
main (int argc, char **argv)
{
pages = atoi(argv[1]);
p = mmap(NULL, pages * PAGESIZE, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANONYMOUS | MAP_NORESERVE, 0, 0);
if (p == MAP_FAILED) {
perror("mmap");
exit(1);
}
if (clone(release, ...may be... I think you misunderstand madvise(MADV_DONTNEED). madvise(DONTNEED) indicate drop process page table. it mean become easily swap. when run on system without swap, madvise(DONTNEED) almost doesn't work as your expected. I am sorry for being not able to help you. ;) --
On Thu, Apr 17, 2008 at 2:30 AM, KOSAKI Motohiro
madvise can be replaced with munmap and the same behavior occurs.
--- test.c.orig 2008-04-17 11:41:47.000000000 -0700
+++ test.c 2008-04-17 11:44:04.000000000 -0700
@@ -127,7 +127,7 @@
/* Release FREE_CHUNK pages. */
for (i = 0; i < FREE_CHUNK; i++) {
- int r = madvise(p + page*PAGESIZE, PAGESIZE, MADV_DONTNEED);
+ int r = munmap(p + page*PAGESIZE, PAGESIZE);
if (r == -1) {
perror("madvise");
exit(1);
Here's what I'm seeing on my system. This is with munmap, but I see
the same thing with madvise. First, /proc/meminfo on my system before
running the test:
# cat /proc/meminfo
MemTotal: 127612 kB
MemFree: 71348 kB
Buffers: 1404 kB
Cached: 52324 kB
SwapCached: 0 kB
Active: 2336 kB
Inactive: 51656 kB
SwapTotal: 0 kB
SwapFree: 0 kB
Dirty: 80 kB
Writeback: 0 kB
AnonPages: 276 kB
Mapped: 376 kB
Slab: 1680 kB
SReclaimable: 824 kB
SUnreclaim: 856 kB
PageTables: 52 kB
NFS_Unstable: 0 kB
Bounce: 0 kB
CommitLimit: 63804 kB
Committed_AS: 908 kB
VmallocTotal: 909280 kB
VmallocUsed: 304 kB
VmallocChunk: 908976 kB
Here is the start and end of the output from the test program. At
each /dev/mem_notify notification Cached decreases, then eventually
Mapped decreases as well, which means the amount of time the program
has to free memory gets smaller and smaller. Finally the oom killer
is invoked because the program can't react quickly enough to free
memory, even though it can free at a faster rate than it can use
memory. My test is slow to free because it calls nanosleep, but this
is just a simulation of my actual program that has to perform garbage
collection before it can free memory.
# ./test_unmap 250000
time: 1208458019
MemTotal: 127612 kB
MemFree: 5524 ...Oh sorry my bad! I investigated again and found 2 problem in your test program. 1. text segment isn't locked. if strong memory pressure happned, kernel may drop program text region. then your test program suddenly slow down. please use mlockall(MCL_CURRENT) before large buffer allocation. 2. repeat open/close to /proc/meminfo. in the fact, open(2) system call use a bit memory. if call open(2) in strong memory pressure, doesn't return until memory freed enough. thus, it cause slow down your program sometimes. attached changed test program :) your proposal is interesting. but I hope try to my attached test program at first.
On Fri, Apr 18, 2008 at 3:07 AM, KOSAKI Motohiro Using mlock does enable the program to respond faster (and/or the kernel doesn't have to find memory to fault the page in) and solves the problem for this simple test program. I think we're thinking of the solution in two different ways: you want the program to react more quickly or be "nicer", and I want the kernel to give notification early enough to allow time for things that can (and do) happen when things aren't so nice. I realize that in extreme circumstances oom may be unavoidable, but a threshold-based notification, in addition to the current /dev/mem_notify mechanism, would help avoid extreme This should be fine; I intentionally do the open/read/write/close I made your changes to my program (I'm using clone since I don't have a pthreads library on my device, and I left PAGESIZE at 4K instead of 64K), and having memory locked does avoid oom in this case, but unfortunately I don't think it's a general solution that will work everywhere in my system. (Although I'm going to try it.) Thanks, .tom --
Hi Tom I have also seen this behaviour in my static tests with low mem notification on swapless systems. It is a problem with small programs (typically static test programs) where the text segment is only a few pages. I have not seen this behaviour in larger programs which use a larger working set. As long as the system working set is bigger than the amount of memory that needs to be allocated, between every notification reaction opportunity, it seems to be ok. /Daniel --
Hi Daniel, You're saying the program's in-core text pages serve as a reserve that the kernel can discard when it needs some memory, correct? And that even if the kernel discards them, it will page them back in as a matter of course as the program runs, to maintain the reserve? That certainly makes sense. In my case of a Java virtual machine, where I originally saw the problem, most of the code is interpreted byte codes or jit-compiled native code, all of which resides not in the text segment but in anonymous pages that aren't backed by a file, and there is no swap space. The actual text segment working set can be very small (memory allocation, garbage collection, synchronization, other random native code). And, as KOSAKI Motohiro pointed out, it may be wise to mlock these areas. So the text working set doesn't make an adequate reserve. However, I can maintain a reserve of cached and/or mapped memory by touching pages in the text segment (or any mapped file) as the final step of low memory notification handling, if the cached page count is getting low. For my purposes, this is nearly the same as having an additional threshold-based notification, since it forces notifications to occur while the kernel still has some memory to satisfy allocations while userspace code works to free memory. And it's simple. Unfortunately, this is more expensive than it could be since the pages need to be read in from some device (mapping /dev/zero doesn't cause pages to be allocated). What I'm looking for now is a cheap way to populate the cache with pages that the kernel can throw away when it needs to reclaim memory. Thanks, .tom --
your memnotify check routine is written by native or java? if native, my suggestion is right. but if java, it is wrong. I hope understand your requirement more. Can I ask your system more? I think all java text and data is mapped. When cached+mapped+free memory is happend? and at the time, What is used memory? Please don't think I have objection your proposal. merely, I don't understand your system yet. if I make new code before understand your requirement exactly, It makes many bug. IMHO threshold based notification has a problems. if low memory happend and application has no freeable memory, mem notification don't stop and increase CPU usage dramatically, but it is perfectly useless. I don't thin embedded java is not important, but I don't hope desktop regression... --
On Thu, May 1, 2008 at 8:06 AM, KOSAKI Motohiro mlocking didn't fix things, it just made the oom happen at a different time (see graphs below), both in the small test program where I used mlockall, and in the jvm where during initialization I read /proc/self/maps and mlocked each region of memory that was mapped to a file. Note that without swap, all of the anonymous pages containing the java code are effectively locked in memory, too, so everything Most simply, I need to get low memory notifications while there is x86, Linux 2.6.23.9 (with your patches trivially backported), 128MB, It's not what /proc/meminfo calls "Mapped". It's in anonymous pages Here's a graph of MemFree, Cached, and Mapped over time (I believe Mapped is mostly or entirely subset of Cached here, so it's not actually important): http://www.tommay.net/memory.png The amount of MemFree fluctuates as java allocates and garbage collects, but the Cached memory decreases (since the kernel has to use it for __alloc_pages when memory is low) until at some point there is no memory to satisfy __alloc_pages and there is an oom. The same things happens if I use mlock, only it happens sooner because the kernel can't discard any of the 15MB of mlock'd memory so it actually runs out of memory faster: http://www.tommay.net/memory-mlock.png I'm not sure how to explain it differently than I have before. Maybe someone else could explain it better. So, at the risk of merely repeating myself: The jvm allocates memory. MemFree decreases. In the kernel, __alloc_pages is called. It finds that memory is low, memory_pressure_notify is called, and some cached pages are moved to the inactive list. These pages may then be used to satisfy __alloc_pages requests. The jvm gets the notification, collects garbage, and returns memory to the kernel which appears as MemFree in /proc/meminfo. The cycle continues: the jvm allocates memory until memory_pressure_notify is called, more cached pages are moved to ...
Wow! you have 2 /dev/mem_notify checking routine? Ah, That's your implementation idea. okey. Mapped of /proc/meminfo mean mapped pages with file backing store. I hope know your system memory usage detail. your system have 128MB, but your graph vertical line represent 0M - 35M. Who use remain 93MB(128-35)? We should know who use memory intead decrease cached memory. So, Can you below operation before mesurement? # echo 100 > /proc/sys/vm/swappiness # echo 3 >/proc/sys/vm/drop_caches and, Can you mesure AnonPages of /proc/meminfo too? (Can your memory shrinking routine reduce anonymous memory?) if JVM use memory as anonymous memory and your memory shrinking routine can't anonymous memory, that isn't mem_notify proble, that is just poor JVM garbege collection problem. Why I think that? mapped page of your graph decrease linearly. if notification doesn't happened, it doesn't decrease. thus, in your system, memory notification is happend rightly. but your JVM doesn't have enough freeable memory. if my assumption is right, increase number of memory notification doesn't solve your problem. Sould we find way of good interaction to JVM GC and mem_notify shrinker? you intent populate to .text segment? Yeah, absolutely. I'll try to set up JVM to my test environment tomorrow. --
All the talk about how what is using memory, whether things are in Java or native, etc., is missing the point. I'm not sure I'm making my point, so I'll try again: regardless of memory size, mlock, etc., the interaction between client and /dev/mem_notify can be unstable, and is unstable in my case: - User-space code page faults in MAP_ANONYMOUS regions until there is no free memory. - The kernel gives a notification. - There kernel frees some cache to satisfy the memory request. - The user-space code gets the notification and frees anonymous pages. Concurrently with this, some thread(s) in the system may continue to page fault. - The cycle repeats. - This works well, perhaps hundreds or thousands of cycles, until all or most of the cache has been freed and we get an oom handling a page fault. My requirement is to have a stable system, with memory allocated on demand to whatever process(es) want it (jvm, web browser, ...) until a low memory notification occurs, which causes them to free whatever memory they no longer need, then continue, without arbitrary static limits on Java heap size, web browser cache size, etc. My workaround to make things stable is to put pages in the cache (after releasing anonymous pages and increasing free memory) by accessing pages in _text, but that seems silly and expensive. .tom On Sat, May 3, 2008 at 5:26 AM, KOSAKI Motohiro --
