A MapReduce style framework for computations on trees

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2010, Pages 343-352

  Sarje, Abhinav ^a   Aluru, Srinivas ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLOUD COMPUTING; CYBER-RESOURCES; FAST MULTIPOLE METHOD; GENERIC PROGRAMMING; HIGH-LEVEL ABSTRACTION; K-NEAREST NEIGHBORS; MAP-REDUCE; MULTI-CORE CLUSTER; PROGRAMMABILITY; SYSTEM ARCHITECTURES; TREE STRUCTURES;

ABSTRACTING; FAULT TOLERANCE; QUALITY ASSURANCE;

TREES (MATHEMATICS);

EID: 78649539332     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2010.42     Document Type: Conference Paper

References (29)

1. J. Dean and S. Ghemawat, "MapReduce: Simplified Data Processing on Large Clusters," in Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation (OSDI'04), 2004.
2. T. Tu, C. A. Rendleman, D.W. Borhani et al., "A scalable parallel framework for analyzing terascale molecular dynamics simulation trajectories," in Proceedings of the Supercomputing Conference (SC'08), 2008.
3. National Science Foundation, "Cluster Exploratory Program (CluE)." [Online]. Available: http://www.nsf.gov/pubs/2008/nsf08560/ nsf08560.htm
4. A. Bialecki, M. Cafarella, D. Cutting et al., "Hadoop: a framework for running applications on large clusters built of commodity hardware," 2005. [Online]. Available: http://lucene.apache.org/hadoop
5. B. C. Catanzaro, N. Sundaram, and K. Keutzer, "A Map Reduce Framework for Programming Graphics Processors," in Workshop on Software Tools for MultiCore Systems, 2008.
6. B. He, W. Fang, Q. Luo et al., "Mars: a MapReduce framework on graphics processors," in Proceedings of the 17th International conference on Parallel Architectures and Compilation Techniques (PACT'08), 2008, pp. 260-269.
7. M. de Kruijf and K. Sankaralingam, "MapReduce for the Cell BE Architecture," Department of Computer Sciences, The University of Wisconsin-Madison, Madison, WI, Tech. Rep. TR1625, 2007.
8. C. Ranger, R. Raghuraman, A. Penmetsa et al., "Evaluating MapReduce for Multi-core and Multiprocessor Systems," in Proceedings of the 13th International Symposium on High Performance Computer Architecture (HPCA'07), 2007, pp. 13-24.
9. H. Yang, A. Dasdan, R. Hsiao, and D. S. Parker, "Mapreduce- merge: simplified relational data processing on large clusters," in Proceedings of the ACM SIGMOD International conference on Management of Data, 2007, pp. 1029-1040.
10. C. Chu, S. K. Kim, Y. Lin et al., "Map-Reduce for Machine Learning on Multicore," in NIPS, B. Schölkopf, J. C. Platt, and T. Hoffman, Eds., 2007, pp. 281-288.
11. C. Jin and R. Buyya, "MapReduce Programming Model for .NET-based Distributed Computing," The University of Melbourne, Australia, Tech. Rep., Oct. 2008.
12. A. Cary, Z. Sun, V. Hristidis et al., "Experiences on Processing Spatial Data with MapReduce," in Proceedings of the 21st International Conference on Scientific and Statistical Database Management (SSDBM'09), 2009, pp. 302-319.
13. B. Panda, J. S. Herbach, S. Basu et al., "PLANET: massively parallel learning of tree ensembles with MapReduce," Proceeding of the 35th International Conference on Very Large Data Bases (VLDB'09), vol. 2, no. 2, pp. 1426-1437, 2009.
14. D. B. Skillicorn, "Structured parallel computation in structured documents," Journal of Universal Computer Science, vol. 3, pp. 42-68, 1997.
15. H. Samet, "Spatial Data Structures," Modern database systems: the object model, interoperability, and beyond, pp. 361-385, 1995.
16. M. de Berg, M. van Kreveld, M. Overmans et al., Computational Geometry: Algorithms and Applications, 2nd ed. Springer, 2000.
17. A. S. Szalay, P. Z. Kunszt, A. R. Thakar et al., "Designing and mining multi-terabyte astronomy archives: The Sloan Digital Sky Survey," in Proceedings of the ACM SIGMOD International conference on Management of Data, vol. 29, no. 2, 2000, pp. 451-462.
18. M. S. Warren and J. K. Salmon, "Astrophysical N-body simulations using hierarchical tree data structures," in Proceedings of the Supercomputing Conference (SC'92), 1992, pp. 570-576.
19. J. Dubinski, "A Parallel Tree Code," New Astronomy, vol. 1, pp. 133-147, 1996.
20. J. A. Board, J. W. Causey, J. F. Leathrum et al., "Accelerated molecular dynamics simulation with the parallel fast multipole method," Chemical Physics Letters, vol. 198, no. 1,2, pp. 89-94, 1992.
21. B. Hariharan, S. Aluru, and B. Shanker, "A scalable parallel fast multipole method for analysis of scattering from perfect electrically conducting surfaces," in Proceedings of the Supercomputing Conference (SC'02), 2002, pp. 1-17.
22. A. Sarje and S. Aluru, "A MapReduce style framework for trees," Electrical and Computer Engineering, Iowa State University, Tech. Rep., June 2009. [Online]. Available: http://archives.ece.iastate.edu/archive/00000495/
23. J. Gibbons, W. Cai, and D. B. Skillicorn, "Efficient parallel algorithms for tree accumulations," Science of Computer Programming, vol. 23, pp. 1-18, 1994.
24. F. E. Sevilgen, S. Aluru, and N. Futamura, "Parallel algorithms for tree accumulations," Journal of Parallel and Distributed Computing, vol. 65, no. 1, pp. 85-93, 2005.
25. --, "A Provably Optimal, Distribution-Independent Parallel Fast Multipole Method," in Proceedings of the 14th International Symposium on Parallel and Distributed Processing (IPDPS'00), 2000, pp. 77-84.
26. M. H. Austern, Generic Programming and the STL, ser. Professional computing series. Addison-Wesley, 1999.
27. B. Hariharan and S. Aluru, "Efficient parallel algorithms and software for compressed octrees with applications to hierarchical methods," Parallel Computing, vol. 31, no. 3+4, pp. 311-331, 2005.
28. F. E. Sevilgen and S. Aluru, "A unifying data structure for hierarchical methods," in Supercomputing conference, 1999, pp. 1-13.
29. L. F. Greengard and V. Rokhlin, "A fast algorithm for particle simulations," Journal of Computational Physics, vol. 73, no. 2, pp. 325-348, 1987.