Abstract
We study an optimization problem that arises in the context of data placement in a multimedia storage system. We are given a collection of M multimedia objects (data items) that need to be assigned to a storage system consisting of N disks d 1,d 2...,d N . We are also given sets U 1,U 2,...,U M such that U i is the set of clients seeking the ith data item. Data item i has size s i . Each disk d j is characterized by two parameters, namely, its storage capacityC j which indicates the maximum total size of data items that may be assigned to it, and a load capacityL j which indicates the maximum number of clients that it can serve. The goal is to find a placement of data items to disks and an assignment of clients to disks so as to maximize the total number of clients served, subject to the capacity constraints of the storage system.
We study this data placement problem for homogeneous storage systems where all the disks are identical. We assume that all disks have a storage capacity of k and a load capacity of L. Previous work on this problem has assumed that all data items have unit size, in other words s i =1 for all i. Even for this case, the problem is NP-hard. For the case where s i ∈ { 1,...,Δ} for some constant Δ, we develop a polynomial time approximation scheme (PTAS). This result is obtained by developing two algorithms, one that works for constant k and one that works for arbitrary k. The algorithm for arbitrary k guarantees that a solution where at least \(\frac{k-\Delta}{k+\Delta}(1-\frac{1}{(1 + \sqrt{\frac{k}{2\Delta}})^2})\) fraction of all clients are assigned to a disk. In addition we develop an algorithm for which we can prove tight bounds when s i ∈ {1,2}. In particular, we can show that a \((1-\frac{1}{(1+\sqrt{\lfloor k/2 \rfloor})^2})\) fraction of all clients can be assigned, regardless of the input distribution.
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
Berson, S., Ghandeharizadeh, S., Muntz, R.R., Ju, X.: Staggered Striping in Multimedia Information Systems. In: SIGMOD, pp. 79–90 (1994)
Chekuri, C., Khanna, S.: On multidimensional packing problems. In: ACM Symp. on Discrete Algorithms, pp. 185–194 (1999)
Chou, C.F., Golubchik, L., Lui, J.C.S.: A performance study of dynamic replication techniques in continuous media servers. CS-TR-3948, University of Maryland (October 1998)
Dawande, M., Kalagnanam, J., Sethuraman, J.: Variable Sized Bin Packing With Color Constraints. Technical report, IBM Research Division, T.J. Watson Research Center (1999)
Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. In: ACM Symp. on Discrete Algorithms, pp. 223–232 (2000)
Lenstra, H.W.: Integer programming with a fixed number of variables. Math. of Oper. Res., 538–548 (1983)
Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 130–143 (1988)
Shachnai, H., Tamir, T.: Approximation schemes for generalized 2-dimensional vector packing with application to data placement. In: Proc. of APPROX (to appear)
Shachnai, H., Tamir, T.: Polynomial time approximation schemes for classconstrained packing problems. In: Proc. of APPROX, pp. 238–249 (2000)
Shachnai, H., Tamir, T.: On two class-constrained versions of the multiple knapsack problem. Algorithmica 29(3), 442–467 (2000)
Stonebraker, M.: A Case for Shared Nothing. Database Engineering 9(1), 4–9 (1986)
Wolf, J., Shachnai, H., Yu, P.: DASD Dancing: A Disk Load Balancing Optimization Scheme for Video-on-Demand Computer Systems. In: ACM SIGMETRICS/ Performance Conf., pp. 157–166 (1995)
Kashyap, S., Khuller, S.: Algorithms for Non-Uniform Size Data Placement on Parallel Disks, Full version available at http://www.cs.umd.edu/~samir/grant/esa03b.ps
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
Kashyap, S., Khuller, S. (2003). Algorithms for Non-uniform Size Data Placement on Parallel Disks. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-24597-1_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20680-4
Online ISBN: 978-3-540-24597-1
eBook Packages: Springer Book Archive