Approximation of a Retrieval Problem for Parallel Disks

We study a number of retrieval problems that relate to effectively using the throughput of parallel disks. These problems can be formulated as assigning a maximum number of jobs to machines of capacity two, where jobs are of size one or two that must satisfy assignment restrictions. We prove that the LP-relaxation of an integer programming formulation is half-integral, and derive an interesting persistency property. In addition, we derive 2/3-approximation results for two types of retrieval problems.

[1]  Fabián A. Chudak,et al.  A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine , 1999, Oper. Res. Lett..

[2]  Ted K. Ralphs,et al.  On the mixed Chinese postman problem , 1993, Oper. Res. Lett..

[3]  Peter Sanders,et al.  Reconciling simplicity and realism in parallel disk models , 2001, SODA '01.

[4]  Lalit M. Patnaik,et al.  Genetic algorithms: a survey , 1994, Computer.

[5]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[6]  Dorit S. Hochbaum,et al.  Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations , 2002, Eur. J. Oper. Res..

[7]  Jan H. M. Korst,et al.  Improving Disk Efficiency in Video Servers by Random Redundant Storage , 2002, IMSA.

[8]  Peter Sanders,et al.  Asynchronous scheduling of redundant disk arrays , 2000, SPAA '00.

[9]  Wim Verhaegh,et al.  Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility , 2001 .

[10]  Berthier A. Ribeiro-Neto,et al.  Comparing random data allocation and data striping in multimedia servers , 2000, SIGMETRICS '00.

[11]  Maria Papadopouli,et al.  A Scable Video-on-Demand Server for a Dynamic Heterogeneous Environment , 1998, Multimedia Information Systems.

[12]  Samir Khuller,et al.  Approximation algorithms for data placement on parallel disks , 2000, SODA '00.

[13]  Milind Dawande,et al.  Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions , 2000, J. Comb. Optim..

[14]  Frits C. R. Spieksma,et al.  Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems , 2003, IEEE Trans. Computers.

[15]  John Wilkes,et al.  An introduction to disk drive modeling , 1994, Computer.

[16]  Hanif D. Sherali,et al.  Persistency in 0-1 Polynomial Programming , 1998, Math. Oper. Res..

[17]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[18]  Russell Greiner,et al.  Efficient reasoning , 2001, CSUR.

[19]  Peter Sanders,et al.  Fast Concurrent Access to Parallel Disks , 2000, SODA '00.

[20]  Jan H. M. Korst.  Random duplicated assignment: an alternative to striping in video servers , 1997, MULTIMEDIA '97.