Weitere Kapitel dieses Buchs durch Wischen aufrufen
Persistent storage is a fundamental abstraction in computing. It consists of a named set of data items that come into existence through explicit creation, persist through temporary failures of the system, until they are explicitly deleted. Sharing of data in distributed systems has become pervasive as these systems have grown in scale in terms of number of machines and the amount of data stored. The phenomenal growth of web services in the past decade has resulted in many Internet companies needing to perform large scale data analysis such as indexing the contents of the billions of websites or analyzing terabytes of traffic logs to mine usage patterns. A study into the economics of distributed computing  published in 2008, revealed that the cost of transferring data across the network is relatively high. Hence moving computation near the data is a more efficient computing model and several large scale, data-intensive application frameworks [2, 3] exemplify this model.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
J. Gray, “Distributed computing economics,” Queue, vol. 6, no. 3, pp. 63–68, 2008. CrossRef
J. Dean and S. Ghemawat, “MapReduce: simplified data processing on large clusters,” Commun. ACM, vol. 51, no. 1, pp. 107–113, 2008. CrossRef
M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly, “Dryad: Distributed data-parallel programs from sequential building blocks,” in EuroSys ’07: Proc. of the 2nd ACM SIGOPS, New York, NY, USA, 2007, pp. 59–72.
J. Dean, “Large-Scale Distributed Systems at Google: Current Systems and Future Directions,” 2009.
J. Gantz and D. Reinsel, “As the economy contracts, the Digital Universe expands,” IDC Multimedia White Paper, 2009.
M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. H. Katz, A. Konwinski, G. Lee, D. A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “Above the Clouds: A Berkeley View of Cloud Computing,” EECS Department, University of California, Berkeley, Tech. Rep., 2009.
S. Ghemawat, H. Gobioff, and S.-T. Leung, “The Google file system,” SIGOPS Oper. Syst. Rev., vol. 37, no. 5, pp. 29–43, 2003. CrossRef
M. K. McKusick and S. Quinlan, “GFS: Evolution on Fast-forward,” Queue, vol. 7, no. 7, pp. 10–20, 2009. CrossRef
D. Roselli, J. Lorch, and T. Anderson, “A comparison of file system workloads,” in Proceedings of the annual conference on USENIX Annual Technical Conference. USENIX Association, 2000.
J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao, “Oceanstore: An architecture for global-scale persistent storage,” in Proc. of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems, 2000.
J. Ledlie, J. Shneidman, M. Seltzer, and J. Huth, “Scooped, again,” Lecture notes in computer science, pp. 129–138, 2003.
R. Sandberg, D. Goldberg, S. Kleiman, D. Walsh, and B. Lyon, “Design and implementation of the sun network filesystem,” in Proceedings of the Summer 1985 USENIX Conference, 1985, pp. 119–130.
J. Howard, M. Kazar, S. Menees, D. Nichols, M. Satyanarayanan, R. Sidebotham, and M. West, “Scale and performance in a distributed file system,” ACM Transactions on Computer Systems (TOCS), vol. 6, no. 1, pp. 51–81, 1988.
D. Eastlake and P. Jones, “US secure hash algorithm 1 (SHA1),” RFC 3174, September, Tech. Rep., 2001.
B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz, “Tapestry: a resilient global-scale overlay for service deployment,” in IEEE J. Selected Areas in Communications, January 2003.
A. Rowstron and P. Druschel, “Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems,” in ACM Middleware, November 2001.
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,” ACM SIGOPS Operating Systems Review, vol. 41, no. 6, p. 220, 2007.
B. Chun, F. Dabek, A. Haeberlen, E. Sit, H. Weatherspoon, M. Kaashoek, J. Kubiatowicz, and R. Morris, “Efficient replica maintenance for distributed storage systems,” in Proc. of NSDI, vol. 6, 2006.
P. Corbett and D. Feitelson, “The Vesta parallel file system,” ACM Transactions on Computer Systems (TOCS), vol. 14, no. 3, pp. 225–264, 1996.
P. Schwan, “Lustre: Building a file system for 1000-node clusters,” in Proceedings of the 2003 Linux Symposium, 2003.
S. Weil, S. Brandt, E. Miller, D. Long, and C. Maltzahn, “Ceph: A scalable, high-performance distributed file system,” in Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI), 2006.
P. Druschel and A. Rowstron, “PAST: A large-scale, persistent peer-to-peer storage utility,” in Proc. HotOS VIII, 2001, pp. 75–80.
F. Dabek, M. Kaashoek, D. Karger, R. Morris, and I. Stoica, “Wide-area cooperative storage with CFS,” ACM SIGOPS Operating Systems Review, vol. 35, no. 5, pp. 202–215, 2001. CrossRef
I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, “Chord: a scalable peer-to-peer lookup service for Internet applications,” in ACM SIGCOMM, August 2001.
T. M. G. Athicha Muthitacharoen, Robert Morris and B. Chen, “Ivy: A Read/Write Peer-to-Peer File System,” in OSDI, December 2002.
R. Hasan, Z. Anwar, W. Yurcik, L. Brumbaugh, and R. Campbell, “A survey of peer-to-peer storage techniques for distributed file systems,” in ITCC, vol. 5, pp. 205–213.
A. Lakshman and P. Malik, “Cassandra: structured storage system on a P2P network,” in Proc. of the 28th ACM symposium on Principles of distributed computing, 2009.
F. Chang, J. Dean, S. Ghemawat, W. Hsieh, D. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. Gruber, “Bigtable: A distributed storage system for structured data,” in Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI06), 2006.
- Scalable Storage for Data-Intensive Computing
Roy H. Campbell
- Springer New York
- Chapter 4
Neuer Inhalt/© ITandMEDIA