It is often preferable to build a storage service out of a collection of individual components rather than out of a single monolithic server. The reasons for preferring such a structure are increased fault-tolerance, scalability, and economics. However, the distributed nature of the system can make it complex to design, difficult to implement, and nearly impossible to test making the whole enterprise a daunting one. One of the ways of reducing the complexity of distributed storage systems is to first design a set of simple abstractions and services that can then be composed easily to provide the required functionality. The talk will illustrate examples of this technique with reference to some systems – Petal ‘96, Frangipani ‘97, Boxwood ‘04, and Eclipse ‘05– on which I have worked. These systems demonstrate that it is feasible to build complex storage systems using a set of building blocks that are easy to design, implement, and test.
For more information about the speaker, see: http://research.microsoft.com/~thekkath/
Thursday, October 13, 2005 - 16:00 to 17:30
Where: DMP 310 - 6245 Agronomy Rd, Vancouver, BC, V6T 1Z4