Messages in this thread | | | Date | Fri, 1 Feb 2013 14:13:29 +1100 | From | paul.szabo@sydney ... | Subject | Re: Bug#695182: [RFC] Reproducible OOM with just a few sleeps |
| |
Dear Ben,
>>>> PAE is broken for any amount of RAM. >>> No it isn't. >> Could I please ask you to expand on that? > > I already did, a few messages back.
OK, thanks. Noting however that fewer than those back, I said: ... PAE with any RAM fails the "sleep test": n=0; while [ $n -lt 33000 ]; do sleep 600 & ((n=n+1)); done and somewhere also said that non-PAE passes. Does not that prove that PAE is broken?
Cheers, Paul
Paul Szabo psz@maths.usyd.edu.au http://www.maths.usyd.edu.au/u/psz/ School of Mathematics and Statistics University of Sydney Australia
| |