Abstract
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 \( \frac{2} {3} \) -approximation results for two types of retrieval problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adams, W.P., J. Bowers Lassiter, and H.D. Sherali (1998), Persistency in 0–1 polynomial programming, Mathematics of Operations Research 23, 359–389.
Aerts, J., J. Korst, F. Spieksma, W. Verhaegh, and G. Woeginger (2002), Load balancing in disk arrays: complexity of retrieval problems, to appear in IEEE Transactions on Computers.
Aerts, J., J. Korst, and W. Verhaegh (2001), Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility, Journal of Scheduling 4, 245–257.
Aerts, J., J. Korst, and W. Verhaegh (2002), Improving disk efficiency in video servers by random redundant storage, To appear in the Proceedings of the 6th IASTED International Conference on Internet and Multimedia Systems and Applications (August 2002).
Chudak, F. and D.S. Hochbaum, (1999), A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine, Operations Research Letters 25, 199–204.
Dawande, M., J. Kalagnanam, P. Keskinocak, F.S. Salman, and R. Ravi (2000), Approximation algorithms for the multiple knapsack problem with assignment restrictions, Journal of Combinatorial Optimization 4, 171–186.
Golubchik, L., S. Khanna, S. Khuller, R. Thurimella, and A. Zhu (2000), Approximation algorithms for data placement on parallel disks, Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 223–232, New York.
Hochbaum, D.S. (2002), Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations, European Journal of Operational Research 140, 291–321.
Korst, J. (1997), Random duplicated Assignment: An alternative to striping in video servers, Proceedings of the ACM Multimedia Conference, pp. 219–226, Seattle.
Nemhauser, G.L. and L.E. Trotter, Jr. (1975), Vertex packings: structural properties and algorithms, Mathematical Programming 8, 232–248.
Papadopouli, M. and L. Golubchik (1998), A scalable video-on-demand server for a dynamic heterogeneous environment, Proceedings of the 4th International Workshop on Advances in Multimedia Information Systems, 4–17.
Ralphs, T.K. (1993), On the mixed chinese postman problem, Operations Research Letters 14, 123–127.
Ruemmler, C. and J. Wilkes (1994), An introduction to disk drive modeling, IEEE Computer 27, 17–28.
Sanders, P. (2000), Asynchronous scheduling for redundant disk arrays, Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures, 98–108.
Sanders, P. (2001), Reconciling simplicity and realism in parallel disk models, Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 67–76.
Sanders, P., S. Egner and J. Korst (2000), Fast concurrent access to parallel disks Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, 849–858.
Santos, J., R. Muntz, and B. Ribeiro-Neto (2000), Comparing random data allocation and data striping in multimedia servers, Proceedings of the ACM Sigmetrics conference on measurements and modelling of computer systems, 44–55.
Vitter, J.S. (2001), External memory algorithms and data structures: Dealing with massive data, ACM Computing Surveys 33, 1–75.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aerts, J., Korst, J., Spieksma, F. (2003). Approximation of a Retrieval Problem for Parallel Disks. In: Petreschi, R., Persiano, G., Silvestri, R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44849-7_23
Download citation
DOI: https://doi.org/10.1007/3-540-44849-7_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40176-6
Online ISBN: 978-3-540-44849-5
eBook Packages: Springer Book Archive