Sciweavers

Share
WCE
2007

A Competitive Online Algorithm for File Restriping

11 years 1 months ago
A Competitive Online Algorithm for File Restriping
—We present a 3-competitive online algorithm for determining when to restripe a file for the case when the optimum stripe depth can take one of two possible values, depending on the application's behavior. We show that a good restriping strategy is to restripe a file when the cost incurred by delaying the restriping process equals the cost of restriping itself. We present an intuitive proof that the cost of this online algorithm is at most 3 times the cost of the optimum offline algorithm.
Mario R. Medina
Related Content
Added 07 Nov 2010
Updated 07 Nov 2010
Type Conference
Year 2007
Where WCE
Authors Mario R. Medina
Comments (0)
books