MSSG: A framework for massive-scale semantic graphs

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn , Issue , 2006, Pages

  Hartley, Timothy D R ^a   Catalyurek, Umit ^a,b   Özgüner, Füsun ^a   Yoo, Andy ^c   Kohn, Scott ^c   Henderson, Keith ^c  

^a The Ohio State University

^b OHIO STATE UNIVERSITY   (United States)

^c LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER COMPUTING; INTERNATIONAL CONFERENCES; MIDDLEWARE FRAMEWORKS; SCALE-FREE; SEMANTIC GRAPHS;

COMPUTER SOFTWARE; GRAPH THEORY; INFORMATION THEORY; MIDDLEWARE; SEMANTICS;

CHLORINE COMPOUNDS;

EID: 46049085210     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2006.311857     Document Type: Conference Paper

References (35)

1. The ABACUS project. http://www.cs.cmu.edu/~amiri/abacus.html.
2. J. Abello, A. L. Buchsbaum, and J. Westbrook. A functional approach to external graph algorithms. Algorithmica, 32(3):437-458, 2002.
3. J. Abello, M. G. C. Resende, and S. Sudarsky. Massive quasi-clique detection. In LATIN, pages 598-612, 2002.
4. M. Aeschlimann, P. Dinda, J. Lopez, B. Lowekamp, L. Kallivokas, and D. O'Hallaron. Preliminary report on the design of a framework for distributed visualization. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99), pages 1833-1839, Las Vegas, NV, June 1999.
5. K. Amiri, D. Petrou, G. R. Ganger, and G. A. Gibson. Dynamic function placement for data-intensive cluster computing. In the USENIX Annual Technical Conference, San Diego, CA, June 2000.
6. L. Arge, O. Procopiuc, and J. S. Vitter. Implementing I/O-efficient data structures using TPIE. In ESA, pages 88-100, 2002.
7. R. H. Arpaci-Dusseau, E. Anderson, N. Treuhaft, D. E. Culler, J. M. Hellerstein, D. Patterson, and K. Yelick. Cluster i/o with river: making the fast case common. In IOPADS '99: Proceedings of the sixth workshop on I/O in parallel and distributed systems, pages 10-22, New York, NY, USA, 1999. ACM Press.
8. D. A. Bader and G. Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (smps). J. Parallel Distrib. Comput., 65(9):994-1006, 2005.
9. M. D. Beynon, R. Ferreira, T. Kure, A. Sussman, and J. Saltz. DataCutter: Middleware for filtering very large scientific datasets on archival storage systems. In Proceedings of the Eighth Goddard Conference on Mass Storage Systems and Technologies/17th IEEE Symposium on Mass Storage Systems, pages 119-133. National Aeronautics and Space Administration, March 2000. NASA/CP 2000-209888.
10. M. D. Beynon, T. Kurc, U. Catalyurek, C. Chang, A. Sussman, and J. Saltz. Distributed processing of very large datasets with DataCutter. Parallel Computing, 27(11): 1457-1478, Oct. 2001.
11. S. Bokhari, B. Rutt, P. Wyckoff, and P. Buerger. An evaluation of the ose fastt600 turbo storage pool. Technical Report OSUBMI_TR_2004-n02, The Ohio State University, Department of Biomedical Informatics, Sep 2004.
12. E. G. Boman, D. Bozdag, U. Catalyurek, A. H. Gebremedhin, and F. Manne. A scalable parallel graph coloring algorithm for distributed memory computers. In EuroPar 2005, 2005.
13. D. Bozdag, U. Catalyurek, A. H. Gebremedhin, F. Manne, E. G. Boman, and F. Özgüner. A parallel distance-2 graph coloring algorithm for distributed memory computers. In The 2005 International Conference on High Performance Computing and Communications (HPCC-05), 2005.
14. A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. Westbrook. On external memory graph traversal. In SODA, pages 859-860, 2000.
15. Common Component Architecture Forum, http://www.cca-forum.org.
16. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In SODA '95: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, pages 139-149, Philadelphia, PA, USA, 1995. Society for Industrial and Applied Mathematics.
17. K. Devine, E. Boman, R. Heaphy, R. Bisseling, and U. Catalyurek. Parallel hypergraph partitioning for scientific computing. In Proceedings of 20th International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2006.
18. T. Eliassi-Rad and E. Chow. Using onto logical information to accelerate search in large semantic graphs: A probabilistic approach. Technical Report UCRL-CONF-20200, Lawrence Livermore National Laboratory.
19. C. Isert and K. Schwan. ACDS: Adapting computational data streams for high performance. In 14th International Parallel & Distributed Processing Symposium (IPDPS 2000), pages 641-646, Cancun, Mexico, May 2000.
20. M. T. Jones and P. Plassmann. A parallel graph coloring heuristic. SIAM J. Sci. Comput., 14(3):654-669, 1993.
21. G. Karypis, K. Schloegel, and V. Kumar. Parmetis: Parallel graph partitioning and sparse matrix ordering library, version 3.1. Technical report, Dept. Computer Science, University of Minnesota, 2003. http://www-users.cs.umn. edu/karypis/metis/parmetis/download.html.
22. T. Kolda and et. al. Data sciences technology for homeland security information management and knowledge discovery. Technical Report UCRL-TR-208926, Lawrence Livermore National Laboratories, 2004. Report of the DHS Workshop on Data Sciences, September 22-23, 2004.
23. E. Konstantinova. Chemical hypergraph theory. Lecture Notes from Combinatorial & Computational Mathametics Center, http://com2mac.postech.ac. kr/, 2000.
24. U. Meyer and N. Zeh. I/o-efficient undirected shortest paths. In ESA, pages 434-445, 2003.
25. MySql Database, http://www.mysql.com/.
26. M. H. Nodine, M. T. Goodrich, and J. S. Vitter. Blocking for external graph searching. Algorithmica, 16(2): 181-214, 1996.
27. R. Oldfield and D. Kotz. Armada: A parallel file system for computational grids. In Proceedings of CCGrid2001: IEEE International Symposium on Cluster Computing and the Grid, Brisbane, Australia, May 2001. IEEE Computer Society Press.
28. F. Olken. Graph data management for molecular biology. OMICS, 7(1):75-78, 2003.
29. B. Piale and K. Schwan. dQUOB: Managing large data flows using dynamic embedded queries. In IEEE International High Performance Distributed Computing (HPDC), August 2000.
30. E. Ramadan, A. Tarafdar, and A. Pothen. A hypergraph model for the protein complex network in the yeast. In Proceedings of 186th International Parallel and Distributed Processing Symposium (IPDPS), Third Workshop on High Performance Computational Biology, Santa Fe, NM, April 2004.
31. Sleepy Cat Software. Berkeley DB. http://www.sleepycat.com/.
32. J. S. Vitter. External memory algorithms and data structures. In J. Abello and J. S. Vitter, editors, External Memory Algorithms and Visualization, pages 1-38. American Mathematical Society Press, Providence, RI, 1999.
33. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Technical Report Technical report DUKE-TR-1993-01, 1993.
34. W. Xu, L. Krishnamurthy, M. Tasan, G. Özsoyoglu, J. H. Nadeau, Z. M. Özsoyoglu, and G. Schaeffer. Pathways database system: An integrated set of tools for biological pathways. In SAC, pages 96-102, 2003.
35. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and U. Catalyurek. A scalable distributed parallel breadth-first search algorithm on BlueGene/L. In Proceedings of SC2005 High Performance Computing, Networking, and Storage Conference, 2005. Gordon Bell Finalist.