Compact, adaptive placement schemes for non-uniform requirements

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2002, Pages 53-62

  Brinkmann, André ^a   Salzwedel, Kay ^a   Scheideler, Christian ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b Johns Hopkins University   (United States)

Author keywords

Adaptive hashing; Balls into bins; Distributed data storage; Non uniform disks; RAID; Random graphs; Web caching

Indexed keywords

ALGORITHMS; BUFFER STORAGE; COMPUTATIONAL COMPLEXITY; SERVERS; TABLE LOOKUP;

ADAPTIVE HASHING; DISTRIBUTED DATA STORAGE; RANDOM GRAPHS; WEB CACHING;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0036948909     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/564875.564878     Document Type: Conference Paper

References (16)

1. B Bollobas. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal of Combinatorics, 1:311-316, 1980.
2. A. Brickmann, K. Salzwedel, and C. Scheideler. Efficient, distributed data placement strategies for storage area networks. In Proc. of the 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA '00), pages 119-128, 2000.
3. T. Cortes and J. Labarta. A case for heterogenenous disk arrays. In Proc. of the IEEE International Conference on Cluster Computing (Cluster'2000), pages 319-325, 2000.
4. T. Cortes and J. Labarta. Extending heterogeneity to RAID level 5. In USENIX 2001, Boston, June 2001.
5. W. Hoeffding. Probability inequalities for sums of bounded random variables. American Statistical Association Journal, 58: 13-30, 1963.
6. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proc. of the 29th ACM Symposium on Theory of Computing, pages 654-663, 1997.
7. V. Lakamraju, I. Koren, and C. Krishna. Synthesis of interconnection networks: A novel approach. In Proc. of the 20th International Conference on Dependable Systems and Networks, pages 56-64, 2000.
8. B. McKay and N. Wormald. Uniform generation of random regular graphs of moderate degree. Journal of Algorithms, 11(1):52-67, 1990.
9. G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter P2P networks. In Proc. of the 42nd IEEE Symposium on Foundations of Computer Science, 492-499, 2001.
10. A. I. T. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Symposium on Operating Systems Principles, pages 188-201, 2001.
11. P. Sanders. Reconciling simplicity and realism in parallel disk models. In Proc. of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 67-76. SIAM, Philadelphia, PA, 2001.
12. A. Steger and N. Wormald. Generating random regular graphs quickly. Combinatorics, Probability and Computing, 8:377-396, 1999.
13. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of the ACM SIGCOMM 2001, pages 149-160, Aug. 2001.
14. G. Tinhofer. Generating graphs uniformly at random. Computing Supplement, 7:235-255, 1990.
15. B. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for faul-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, University of California at Berkeley, Berkeley, California 94720, April 2001.
16. R. Zimmermann and S. Ghandeharizadeh. HERA: Heterogeneous extension of RAID. In Proc. of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2000), 2000.