Re: [ANNOUNCE] Ramback: faster than a speeding bullet

[Daniel Phillips <phillips@phunq.net>]

On Tuesday 11 March 2008 04:23, Lars Marowsky-Bree wrote:
> If I always assume a reliable shutdown - UPS protected, no crashes, etc
> - you're right, but at least my real world has other failure scenarios
> as well. In fact, the most common reason for unorderly shutdowns are
> kernel crashes, not power failures in my experience.

What are you doing to your kernel?

My desktop at home, which runs my MTA, web site etc, and is subject to
regular oom abuse by firefox:

$ uptime
04:36:49 up 204 days,  9:38,  8 users,  load average: 0.82, 0.43, 0.20

This machine has been up ever since I got a UPS for it, and then it
only ever went down due to a blackout or my wife blowing a fuse with
the vacuum cleaner.  Honestly, I have never seen a machine running
Linux 2.6 crash due to a software flaw, except when I caused it
myself.  I suspect the Linux kernel has a better MTBF than a hard
disk.

> So "perfectly reliable if UPS power does not fail" seems a bit over the
> top.

It works for EMC :-)

> I was trying to prod you into writing the ordered flushing. Maybe
> claiming it is too hard will do the trick? ;-)
> 
> Seriously, I guess it depends on the workload you want to host.

I agree this would be a nice option to have.

> > If you think this is like replication then you have the wrong idea
> > about what is going on.  This is a cache consistency algorithm, not
> > a replication algorithm.
> 
> I see the differences, but I also see the similarities. What you're
> doing can also be thought of as replicating from an instant IO store
> (local memory) to a high latency, low bandwidth copy (the disk)
> asynchronously.
> 
> Both obviously need to preserve consistency, the question is whether to
> achieve transactional (ordered) consistency or not.

In fact, replicating was one of the strategies I considered for this.
But since it is a lot more work and will not perform as well as a
simple sweep, I opted for the simple thing.  Which turned out to
be pretty complex anyway.  You have to close all the same nasty
races but with a considerably more complex base algorithm.  I think
that better wait for version 2.0.

By the way, I could use a hand debugging this thing.

Regards,

Daniel