Date: Mon, 27 Oct 1997 18:25:44 -0500 (EST) From: Alfred Perlstein <perlsta@cs.sunyit.edu> To: Terry Lambert <tlambert@primenet.com> Cc: hackers@FreeBSD.ORG Subject: Re: help with fstat? and improvement on FreeBSD? Message-ID: <Pine.BSF.3.96.971027181254.974A-100000@server.local.sunyit.edu> In-Reply-To: <199710271815.LAA23283@usr04.primenet.com>
next in thread | previous in thread | raw e-mail | index | archive | help
that doesn't seem to be too hard to implement and could signifigantly speed up a LOT of things, would anyone want to tackle this problem? maybe someone could point me to where this code is located... i would like to try, i'm sure though, that someone with a bit more experiance would find it very easy to implement. in my opinion, many many things would gain a lot more speed if this algorithm was implement. -Alfred > > Remember also that each process has its own virtual address space. > > They can't "collide" with each other in some way. Each process could > > mmap huge chunks and you'd never have to worry. > > Except if you linearly traverse the mapped file, and it's a big file. > Then it will force almost all other clean pages out of core via LRU. > > So you can thrash the paging algorithm this way. > > But you can also thrash it (albiet less quickly) using reads. > > There used to be a MAP_SEQUENTIAL flag to get it to discard buffers > after they had been accesed, instead of forcing more pages off the > LRU, but BSD doesn't support this. 8-(. > > > Terry Lambert > terry@lambert.org > --- > Any opinions in this posting are my own and not those of my present > or previous employers. >
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.BSF.3.96.971027181254.974A-100000>