Ex-mATE: Data intensive computing with large reduction objects and its application to graph mining

Proceedings - 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGrid 2011

Volumn , Issue , 2011, Pages 475-484

  Jiang, Wei ^a   Agrawal, Gagan ^a  

^a Ohio State University   (United States)

Author keywords

clusters; data intensive computing; graph mining; map reduce; multi core architectures

Indexed keywords

CLUSTERS; DATA-INTENSIVE COMPUTING; GRAPH MINING; MAP-REDUCE; MULTICORE ARCHITECTURES;

CLUSTER COMPUTING; GRID COMPUTING;

CLOUD COMPUTING;

EID: 79961142851     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGrid.2011.18     Document Type: Conference Paper

References (37)

1. Sergey Brin and Lawrence Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30(1- 7):107-117, 1998.
2. Jiyang Chen, Osmar R. Zaïane, and Randy Goebel. Detecting communities in social networks using max-min modularity. In SDM, pages 978-989, 2009.
3. Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding, Philip S. Yu, and Haixun Wang. Fast graph pattern matching. In ICDE, pages 913-922, 2008.
4. Hung chih Yang, Ali Dasdan, Ruey-Lung Hsiao, and Douglas Stott Parker Jr. Map-reduce-merge: simplified relational data processing on large clusters. In SIGMOD, pages 1029-1040, 2007.
5. Cheng-Tao Chu, Sang Kyun Kim, Yi-An Lin, YuanYuan Yu, Gary R. Bradski, Andrew Y. Ng, and Kunle Olukotun. Map-reduce for machine learning on multicore. In NIPS, pages 281- 288, 2006.
6. Tyson Condie, Neil Conway, Peter Alvaro, Joseph M. Hellerstein, Khaled Elmeleegy, and Russell Sears. Mapreduce online. In NSDI, pages 313-328, 2010.
7. Jonathan Conhen. Graph twiddling in a mapreduce world. Computing in Science Engineering, 11(4):29-41, jul. 2009.
8. Jeffrey Dean and Sanjay Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137-150, 2004.
9. Reza Farivar, Abhishek Verma, Ellick Chan, and Roy Campbell. Mithra: Multiple data independent tasks on a heterogeneous resource architecture. In CLUSTER. IEEE, 2009.
10. Dan Gillick, Arlo Faria, and John Denero. Mapreduce: Distributed computing for machine learning. 2008.
11. Bingsheng He, Wenbin Fang, Qiong Luo, Naga K. Govindaraju, and Tuyong Wang. Mars: a mapreduce framework on graphics processors. In PACT, pages 260-269, 2008.
12. Daniel S. Hirschberg, Ashok K. Chandra, and Dilip V. Sarwate. Computing connected components on parallel computers. Commun. ACM, 22(8):461-464, 1979.
13. Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, and Dennis Fetterly. Dryad: distributed data-parallel programs from sequential building blocks. In EuroSys, pages 59-72, 2007.
14. Wei Jiang, Vignesh T. Ravi, and Gagan Agrawal. Comparing map-reduce and freeride for data-intensive applications. In Cluster, pages 1-10. IEEE, 2009.
15. Wei Jiang, Vignesh T. Ravi, and Gagan Agrawal. A map-reduce system with an alternate api for multi-core environments. In CCGRID, pages 84-93, 2010.
16. Ruoming Jin and Gagan Agrawal. A middleware for developing parallel data mining implementations. In Proceedings of the first SIAM conference on Data Mining, April 2001.
17. Ruoming Jin and Gagan Agrawal. Shared Memory Parallelization of Data Mining Algorithms: Techniques, Programming Interface, and Performance. In Proceedings of the second SIAM conference on Data Mining, April 2002.
18. Karthik Kambatla, Naresh Rapolu, Suresh Jagannathan, and Ananth Grama. Relaxed synchronization and eager scheduling in mapreduce. Technical Report CSD-TR-09-010, Department of Computer Science, Purdue University, 2009.
19. U. Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, and Jure Leskovec. Hadi: Fast diameter estimation and mining in massive graphs with hadoop. Technical Report CMU-ML-08-117, School of Computer Science, Carnegie Mellon University, 2008.
20. U. Kang, Charalampos E. Tsourakakis, and Christos Faloutsos. Pegasus: A peta-scale graph mining system. In ICDM, pages 229-238, 2009.
21. Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. In SODA, pages 668-677, 1998.
22. Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, and Joseph M. Hellerstein. Graphlab: A new parallel framework for machine learning. In Conference on Uncertainty in Artificial Intelligence (UAI), Catalina Island, California, July 2010.
23. Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD, pages 135-146, 2010.
24. Christopher Olston, Benjamin Reed, Utkarsh Srivastava, Ravi Kumar, and Andrew Tomkins. Pig latin: a not-so-foreign language for data processing. In SIGMOD, pages 1099-1110, 2008.
25. Rob Pike, Sean Dorward, Robert Griesemer, and Sean Quinlan. Interpreting the data: Parallel analysis with sawzall. Scientific Programming, 13(4):277-298, 2005.
26. Tieyun Qian, Jaideep Srivastava, Zhiyong Peng, and Phillip C.- Y. Sheu. Simultaneously finding fundamental articles and new topics using a community tracking method. In PAKDD, pages 796-803, 2009.
27. Colby Ranger, Ramanan Raghuraman, Arun Penmetsa, Gary R. Bradski, and Christos Kozyrakis. Evaluating mapreduce for multi-core and multiprocessor systems. In Proceedings of 13th HPCA, pages 13-24, 2007.
28. Sayan Ranu and Ambuj K. Singh. Graphsig: A scalable approach to mining significant subgraphs in large graph databases. In ICDE, pages 844-855, 2009.
29. Abhinav Sarje and Srinivas Aluru. A mapreduce style framework for computations on trees. In ICPP, 2010.
30. Sangwon Seo, Ingook Jang, Kyungchang Woo, Inkyo Kim, Jin- Soo Kim, and Seungryoul Maeng. Hpmr: Prefetching and pre-shuffling in shared mapreduce computation environment. In CLUSTER. IEEE, 2009.
31. Nisheeth Shrivastava, Anirban Majumder, and Rajeev Rastogi. Mining (social) network graphs to detect random link attacks. In ICDE, pages 486-495, 2008.
32. Ashish Thusoo, Joydeep Sen Sarma, Namit Jain, Zheng Shao, Prasad Chakka, Suresh Anthony, Hao Liu, Pete Wyckoff, and Raghotham Murthy. Hive - a warehousing solution over a mapreduce framework. PVLDB, 2(2):1626-1629, 2009.
33. Charalampos E. Tsourakakis, U. Kang, Gary L. Miller, and Christos Faloutsos. Doulion: counting triangles in massive graphs with a coin. In KDD, pages 837-846, 2009.
34. Abhishek Verma, Nicolas Zea, Brian Cho, Indranil Gupta, and Roy H. Campbell. Breaking the mapreduce stage barrier. In CLUSTER. IEEE, 2010.
35. Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, and Anthony K. H. Tung. Csv: visualizing and mining cohesive subgraphs. In SIGMOD, pages 445-458, 2008.
36. Richard M. Yoo, Anthony Romano, and Christos Kozyrakis. Phoenix rebirth: Scalable mapreduce on a large-scale shared-memory system. In IISWC, pages 198-207, 2009.
37. Matei Zaharia, Andy Konwinski, Anthony D. Joseph, Randy H. Katz, and Ion Stoica. Improving mapreduce performance in heterogeneous environments. In OSDI, pages 29-42, 2008.