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.

• Type: Conference
• Year: 2007
• Where: WCE
• Authors: Mario R. Medina
• Keywords: 3-competitive Online Algorithm, Online Algorithm, Optimum Stripe Depth, WCE 2007, WCE 2008