Re: [9fans] Kernel panic when allocating a huge memory

[tlaronde@polynum.com]

On Sat, Nov 03, 2012 at 06:48:47PM +0000, Charles Forsyth wrote:
> Wilkes has a nice discussion of paging algorithms as an application of
> control theory
> in "The Dynamics of Paging".
> http://comjnl.oxfordjournals.org/content/16/1/4.short
>
> "It is notorious that the use of apparently innocuous scheduling and paging
> algorithms can give rise to the type of unstable behaviour known as
> thrashing."

Just for the (historical) record, the original G.R.A.S.S. team, since
the processing i.e. some kind of sorting of huge data typically raster
may need a lot of memory, went as far as implementing a library in
G.R.A.S.S. to do user level paging and swapping (indeed segmentation and
use of disks but actually file system use to store segments of
processing---the segment library).

Has a "paging / swapping" filesystem (non persistent data, processes dependant
timelife "memory" allocation, with storing/reloading to/from disk, and
use of real memory when available) been attempted?

--
        Thierry Laronde <tlaronde +AT+ polynum +dot+ com>
                      http://www.kergis.com/
Key fingerprint = 0FF7 E906 FBAF FE95 FD89  250D 52B1 AE95 6006 F40C