>>>>> "Mike" == Mike Mascari <mascarm@mascari.com> writes:
Mike> Robert Treat wrote:
>> While some form of bitmapped indexing would be cool, other ideas might >> be to implement different buffer
managerstrategies. I was impressed by >> how quickly Jan was able to implement ARC over LRU, but there are a host
>>of other strategies that could also be implemented.
We already do that !
We have a first "warm-up" assignment for which they get 2 weeks and
have to change the strategy to MRU from LRU (in an earlier semester
they were assigned 2Q). The idea here more to just get used to the
code and the debugger.
Sadly the undergraduate OS class uses Java (horrors) as an
implementation language and many of our juniors and seniors are not as
uncomfortable with C programming (and pointers) as I'd like. The good
news is that they all pretty much got into the groove fast.
Re PITR, maybe that's an option - the thing is we are looking less at
a full semester long project and more at a 3/4 week assignment where
students get to hack something, learn about the practical side to
what's in lecture, and learn to do some performance comparisons.
Mike> If you go to sequential access of larger chunks of the disk, you will Mike> get 500 times more bandwidthyou
canread or write the disk in a day. Mike> So programmers have to start thinking of the disk as a sequential Mike>
devicerather than a random access device."
Mike> Isn't a TID-List-Fetch implementation a crucial first step in the Mike> right direction?
I believe so .. I think it's a clear win. I believe there are some
concurrency issues although I'm not sure .. what if there is a vaccuum
that comes in between building the Tid list and then doing a fetch ?
--
Pip-pip
Sailesh
http://www.cs.berkeley.edu/~sailesh
