"All roads lead to rome:" Optimistic recovery for distributed iterative data processing

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2013, Pages 1919-1928

  Schelter, Sebastian ^a   Ewen, Stephan ^a   Tzoumas, Kostas ^a   Markl, Volker ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Fault tolerance; Iterative algorithms; Optimistic recovery

Indexed keywords

ANALYTICAL APPLICATIONS; DATA FLOW SYSTEMS; EXPERIMENTAL EVALUATION; FIX-POINT ALGORITHMS; ITERATIVE ALGORITHM; PESSIMISTIC APPROACH; RECOVERY MECHANISMS; ROLL-BACK RECOVERIES;

ALGORITHMS; DATA MINING; DATA PROCESSING; FAULT TOLERANCE; KNOWLEDGE MANAGEMENT; LEARNING SYSTEMS; OPTIMIZATION; RECOVERY; SEMANTICS;

ITERATIVE METHODS;

EID: 84889563336     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505515.2505753     Document Type: Conference Paper

References (34)

1. Apache Giraph, http://giraph.apache.org.
2. Apache Hadoop, http://hadoop.apache.org.
3. D. Battré, S. Ewen, F. Hueske, O. Kao, V. Markl, and D. Warneke. Nephele/PACTs: A programming model and execution framework for web-scale analytical processing. In SoCC, pp. 119-130, 2010.
4. D. Bertsekas and J. Tsitsiklis. Parallel and Distributed Computation. Athena Scientific, 1997.
5. P. Boldi and S. Vigna. The Webgraph Framework I: Compression techniques. In WWW, pp. 595-602, 2004.
6. P. Bonacich. Power and Centrality: A family of measures. American Journal of Sociology, pp. 1170-1182, 1987.
7. V. R. Borkar, M. J. Carey, R. Grover, N. Onose, and R. Vernica. Hyracks: A flexible and extensible foundation for data-intensive computing. In ICDE, pp. 1151-1162, 2011.
8. Y. Bu, V. R. Borkar, M. J. Carey, J. Rosen, N. Polyzotis, T. Condie, M. Weimer, and R. Ramakrishnan. Scaling datalog for machine learning on big data. CoRR, abs/1203.0160, 2012.
9. M. Burrows. The Chubby lock service for loosely-coupled distributed systems. In OSDI, pp. 335-350, 2006.
10. M. Cha, H. Haddadi, F. Benevenuto, and P. K. Gummadi. Measuring user influence in Twitter: The million follower fallacy. In ICWSM, 2010.
11. A. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: Scalable online collaborative filtering. In WWW, pp. 271-280, 2007.
12. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. Commun. ACM, 51(1):107-113, 2008.
13. E. N. Elnozahy, L. Alvisi, Y.-M. Wang, and D. B. Johnson. A survey of rollback-recovery protocols in message-passing systems. ACM Comput. Surv., 34(3):375-408, 2002.
14. S. Ewen, K. Tzoumas, M. Kaufmann, and V. Markl. Spinning fast iterative data flows. PVLDB, 5(11):1268-1279, 2012.
15. H. Garcia-Molina and K. Salem. Sagas. In SIGMOD, pp. 249-259, 1987.
16. R. Gemulla, E. Nijkamp, P. J. Haas, and Y. Sismanis. Large-scale matrix factorization with distributed stochastic gradient descent. In KDD, pp. 69-77, 2011.
17. S. Ghemawat, H. Gobioff, and S.-T. Leung. The Google file system. In SOSP, pp. 29-43, 2003.
18. G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, 1996.
19. M. Gondran and M. Minoux. Graphs, Dioids and Semirings - New Models and Algorithms. Springer, 2008.
20. U. Kang, S. Papadimitriou, J. Sun, and H. Tong. Centralities in large networks: Algorithms and observations. In SDM, pp. 119-130, 2011.
21. U. Kang, C. E. Tsourakakis, and C. Faloutsos. Pegasus: A peta-scale graph mining system. In ICDM, pp. 229-238, 2009.
22. L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18(1):39-43, 1953.
23. Y. Koren, R. M. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. IEEE Computer, 2009.
24. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. Distributed GraphLab: A framework for machine learning in the cloud. PVLDB, 5(8):716-727, 2012.
25. G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: A system for large-scale graph processing. In SIGMOD pp. 135-146, 2010.
26. F. McSherry, D. G. Murray, R. Isaacs, and M. Isard. Differential dataflow. In CIDR, 2013.
27. S. R. Mihaylov, Z. G. Ives, and S. Guha. Rex: Recursive, delta-based data-centric computation. PVLDB, 5(11):1280-1291, 2012.
28. M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E, 74:036104, 2006.
29. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Stanford InfoLab, 1999.
30. A. Reuter and F. Schwenkreis. Con Tracts - A low-level mechanism for building general-purpose workflow management-systems. IEEE Data Eng. Bull., 18(1):4-10, 1995.
31. M. Zaharia, M. Chowdhury, T. Das, D. Ankur, M. McCauley, M. Franklin, S. Shenker and I. Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. NDSI, pp. 2-2 2012.
32. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103-111, 1990.
33. M. Zaharia, T. Das, H. Li, S. Shenker, and I. Stoica. Discretized streams: An efficient and fault-tolerant model for stream processing on large clusters. In HotCLoud, 2012.
34. Y. Zhou, D. M. Wilkinson, R. Schreiber, and R. Pan. Large-scale parallel collaborative filtering for the netflix prize. In AAIM, pp. 337-348, 2008.