Small cache, big effect: Provable load balancing for randomly partitioned cluster services

Proceedings of the 2nd ACM Symposium on Cloud Computing, SOCC 2011

Volumn , Issue , 2011, Pages

  Fan, Bin ^a   Lim, Hyeontaek ^a   Andersen, David G ^a   Kaminsky, Michael ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

Caching; Clusters; Load balancing; Performance

Indexed keywords

BACK-END SERVERS; CACHE SIZE; CACHING; CLUSTERS; COMPUTING SERVICES; EMPIRICAL RESULTS; PERFORMANCE; PERFORMANCE BOTTLENECKS; SERVICE LEVEL OBJECTIVE; STORAGE SYSTEMS;

CLUSTER COMPUTING; PARALLEL ARCHITECTURES; RESOURCE ALLOCATION;

CLOUD COMPUTING;

EID: 82155187148     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2038916.2038939     Document Type: Conference Paper

References (32)

1. Hadoop. http://hadoop.apache.org/, 2011.
2. HBase. http://hbase.apache.org/, 2011.
3. Intel Threading Building Blocks. http:// threadingbuildingblocks.org/, 2011.
4. Apache Thrift. https://thrift.apache.org/, 2011.
5. M. Al-Fares, A. Loukissas, and A. Vahdat. A scalable, commodity, data center network architecture. In Proc. ACM SIGCOMM, Aug. 2008.
6. D. G. Andersen, J. Franklin, M. Kaminsky, A. Phanishayee, L. Tan, and V. Vasudevan. FAWN: A fast array of wimpy nodes. In Proc. 22nd ACM Symposium on Operating Systems Principles (SOSP), Oct. 2009.
7. I. Ari, B. Hong, E. Miller, S. Brandt, and D. Long. Managing flash crowds on the Internet. In Proceedings of 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems (MASCOTS'03), pages 246-249, Oct. 2003.
8. D. Beaver, S. Kumar, H. C. Li, J. Sobel, and P. Vajgel. Finding a needle in Haystack: Facebook's photo storage. In Proc. 9th USENIX OSDI, Oct. 2010.
9. M. Berezecki, E. Frachtenberg, M. Paleczny, and K. Steele. Many-core key-value store. http://gigaom2.files.wordpress.com/2011/07/facebook-tilera- whitepaper.pdf.
10. A. Bestavros. WWW trafic reduction and load balancing through server-based caching. Concurrency, IEEE, 5(1):56-67, 1997. (Pubitemid 127559572)
11. F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber. Bigtable: A distributed storage system for structured data. In Proc. 7th USENIX OSDI, Nov. 2006.
12. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Widearea cooperative storage with CFS. In Proc. 18th ACM Symposium on Operating Systems Principles (SOSP), Oct. 2001.
13. J. Dean. Challenges in building large-scale information retrieval systems: invited talk. In Proceedings of the Second ACM International Conference on Web Search and Data Mining, WSDM '09. ACM, 2009.
14. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In Proc. 6th USENIX OSDI, Dec. 2004.
15. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: Amazon's highly available key-value store. In Proc. 21st ACM Symposium on Operating Systems Principles (SOSP), Oct. 2007.
16. M. Dobrescu, N. Egi, K. Argyraki, B.-G. Chun, K. Fall, G. Iannaccone, A. Knies, M. Manesh, and S. Ratnasamy. RouteBricks: Exploiting parallelism to scale software routers. In Proc. 22nd ACM Symposium on Operating Systems Principles (SOSP), Oct. 2009.
17. D. Ford, F. Labelle, F. Popovici, M. Stokely, V.-A. Truong, L. Barroso, C. Grimes, and S. Quinlan. Availability in globally distributed storage systems. In Proc. 9th USENIX OSDI, Oct. 2010.
18. S. Ghemawat, H. Gobiofi, and S.-T. Leung. The Google file system. In Proc. 19th ACM Symposium on Operating Systems Principles (SOSP), Oct. 2003.
19. S. D. Gribble, E. A. Brewer, J. M. Hellerstein, and D. Culler. Scalable, distributed data structures for Internet service construction. In Proc. 4th USENIX OSDI, Nov. 2000.
20. S. Han, K. Jang, K. Park, and S. Moon. PacketShader: a GPUaccelerated software router. In Proc. ACM SIGCOMM, Aug. 2010.
21. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: Distributed Data-Parallel Programs from Sequential Building Blocks. In Proc. EuroSys, Mar. 2007.
22. V. Janapa Reddi, B. C. Lee, T. Chilimbi, and K. Vaid. Web search using mobile cores: quantifying and mitigating the price of eficiency. In Proceedings of the 37th annual international symposium on Computer architecture, ISCA '10, pages 314-325. ACM, 2010. ISBN 978-1-4503-0053-7.
23. D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 654-663. ACM, 1997.
24. E. P. Markatos. On caching search engine query results. Computer Communications, 24(2):137-143, 2001. ISSN 0140-3664. (Pubitemid 32092795)
25. Memcached. A distributed memory object caching system. http: //memcached.org/, 2011.
26. M. Mitzenmacher, A. W. Richa, and R. Sitaraman. The power of two random choices: A survey of techniques and results. In Handbook of Randomized Computing, pages 255-312. Kluwer, 2000.
27. O. O'Malley and A. Murthy. Winning a 60 Second Dash with a Yellow Elephant. http://sortbenchmark.org/Yahoo2009.pdf, Apr. 2009.
28. J. Ousterhout, P. Agrawal, D. Erickson, C. Kozyrakis, J. Leverich, D. Mazières, S. Mitra, A. Narayanan, G. Parulkar, M. Rosenblum, S. M. Rumble, E. Stratmann, and R. Stutsman. The case for RAMClouds: Scalable high-performance storage entirely in DRAM. In Operating Systems Review, volume 43, pages 92-105, Jan. 2010.
29. D. A. Patterson, G. Gibson, and R. H. Katz. A case for redundant arrays of inexpensive disks (RAID). In Proc. ACM SIGMOD, 1988.
30. M. Raab and A. Steger. "Balls into bins"-a simple and tight analysis. In Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM '98, pages 159-170. Springer-Verlag, 1998.
31. P. Scheuermann, G. Weikum, and P. Zabback. Data partitioning and load balancing in parallel disk systems. The VLDB Journal, 7:48-66, Feb. 1998. ISSN 1066-8888. (Pubitemid 128382397)
32. 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. ACM SIGCOMM, Aug. 2001.