Design distributed digraph algorithms using MapReduce

Journal of Computational Information Systems

Volumn 7, Issue 7, 2011, Pages 2267-2276

  Li, Desheng ^a   Cheng, Bo ^a   Deng, Na ^a   Li, Changbao ^a   Chen, Junliang ^a   Liu, Chuanchang ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Cloud; Digraph; MapReduce; Max flow

Indexed keywords

DIGRAPH; DISTRIBUTED DATA; MAP-REDUCE; MAX-FLOW; SIMULATION ENVIRONMENT;

ABSTRACTING; ALGORITHMS; DATA STRUCTURES; MATHEMATICAL MODELS; PROBLEM SOLVING;

GRAPH THEORY;

EID: 79960148961     PISSN: 15539105     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. J. Dean and S. Ghemawat, MapReduce: simplified data processing on large clusters. OSDI'04: Proceedings of the 6th conference on Symposium on Operating Systems Design & Implementation, pages 10, 2004.
2. Apache. Hadoop. http://lucene.apache.org/hadoop/, 2006.
3. U. Kang, C. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec, HADI: Fast Diameter Estimation and Mining in Massive Graphs with Hadoop, Technical report, School of Computer Science, Carnegie Mellon University Pittsburgh, 2008.
4. U. Kang, C. E. Tsourakakis and C. Faloutsos, PEGASUS: A Peta-Scale Graph Mining System. ICDM, IEEE Computer Society, pages 229-238, 2009.
5. L. Page, S. Brin, R. Motwani and T. Winograd, The PageRank citation ranking: Bringing order to the Web. Proceedings of the 7th International World Wide Web Conference, pages 161-172, 1998.
6. J. Cohen, Graph Twiddling in a MapReduce World. Computing in Science and Engineering, pages 29-41, 2009.
7. G. Adomavicius and A. Tuzhilin, Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions. Knowledge and Data Engineering, IEEE Transactions, 17(6), pages 734-749, 2005.
8. N. Xie, A theoretical study of MapReduce A theoretical study of MapReduce, CSAIL, MIT, pp. 1-5.
9. D. Rao and D. Yarowsky, Ranking and semi-supervised classification on large scale graphs using map-reduce. TextGraphs-4: Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing, Association for Computational Linguistics, Morristown, pages 58-65, 2009.
10. K. Howard, S. Siddharth and V. Sergei. A model of computation for MapReduce. In SODA'10, pages 938-948, 2010.
11. H. Y. Chih, A. Dasdan, R.-L. Hsiao and D. S. Parker, Map-reduce-merge: simplified relational data processing on large clusters. SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pages 1029-1040, 2007.
12. J. Lin and M. Schatz, Design patterns for efficient graph algorithms in MapReduce. MLG '10: Proceedings of the Eighth Workshop on Mining and Learning with Graphs, pages 78-85, 2010.
13. R. Chen, X. Weng, B. He and M. Yang, Large graph processing in the cloud. SIGMOD '10: Proceedings of the 2010 international conference on Management of data, pages 1123-1126, 2010.
14. L. M. Goldschlager, R. A. Shaw and J. Staples, The maximum flow problem is log space complete for P. Theoretical Computer Science, 21(1), pages 105-111, 1982.
15. Y. Shiloach and U. Vishkin, An O(n2 log n) parallel max-flow algorithm. J. Algorithms, 3(2), pages 128-146. 1982.
16. U. Vishkin, A parallel blocking flow algorithm for acyclic networks, J. Algorithms, 13(3), pages 489-501, 1992.
17. L. Desheng, L. Chuanchang, D. Na, L. Changbao and C. Junliang, An Simulation of MapReduce as a Higher-Order Web Service in Cloud. CiSE2010, pages 1-4, 2010.