Algorithms for non-uniform size data placement on parallel disks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2914, Issue , 2003, Pages 265-276

  Kashyap, Srinivas ^a   Khuller, Samir ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SOFTWARE ENGINEERING;

CAPACITY CONSTRAINTS; INPUT DISTRIBUTIONS; MULTIMEDIA OBJECT; MULTIMEDIA STORAGE; OPTIMIZATION PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; STORAGE CAPACITY; STORAGE SYSTEMS;

DIGITAL STORAGE;

EID: 35248814292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24597-1_23     Document Type: Article

References (13)

1. S. Berson, S. Ghandeharizadeh, R. R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. SIGMOD, pages 79-90, 1994.
2. C. Chekuri and S. Khanna. On multidimensional packing problems. In ACM Symp. on Discrete Algorithms, pages 185-194, 1999.
3. C. F. Chou, L. Golubchik, and J. C.S. Lui. A performance study of dynamic replication techniques in continuous media servers. CS-TR-3948, University of Maryland, October 1998.
4. M. Dawande, J. Kalagnanam, and J. Sethuraman. Variable Sized Bin Packing With Color Constraints. Technical report, IBM Research Division, T.J. Watson Research Center, 1999.
5. L. Golubchik, S. Khanna, S. Khuller, R. Thurimella, and A. Zhu. Approximation algorithms for data placement on parallel disks. In ACM Symp. on Discrete Algorithms, pages 223-232, 2000.
6. H. W. Lenstra. Integer programming with a fixed number of variables. Math. of Oper. Res., pages 538-548, 1983.
7. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 130-143, 1988.
8. H. Shachnai and T. Tamir. Approximation schemes for generalized 2-dimensional vector packing with application to data placement. Proc. of APPROX, to appear.
9. H. Shachnai and T. Tamir. Polynomial time approximation schemes for class-constrained packing problems. Proc. of APPROX, pages 238-249, 2000.
10. H. Shachnai and T. Tamir. On two class-constrained versions of the multiple knapsack problem. Algorithmica, Vol. 29, Issue 3, pages 442-467, 2000.
11. M. Stonebraker. A Case for Shared Nothing. Database Engineering, 9(1):4-9, 1986.
12. J. Wolf, H. Shachnai, and P. Yu. DASD Dancing: A Disk Load Balancing Optimization Scheme for Video-on-Demand Computer Systems. In ACM SIGMET-RICS/Performance Conf., pages 157-166, 1995.
13. S. Kashyap and S. Khuller Algorithms for Non-Uniform Size Data Placement on Parallel Disks. Full version available at http://www.cs.umd.edu/∼samir/grant/esa03b.ps