Database Reference
In-Depth Information
28. P.-O. Fjallstrom. Algorithms for graph partitioning: A survey.
Linkoping Electronic
Articles in Computer and Information Science
, 1998.
29. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified np-complete prob-
lems. In
Proceedings of the Sixth Annual ACM Symposium on Theory of Computing,
STOC'74
, pages 47-63, New York, 1974. ACM.
30. S. Ghemawat, H. Gobioff, and S.-T. Leung. The Google file system.
SIGOPS Oper. Syst.
Rev.
, 37(5):29-43, 2003.
31. D. Gregor and A. Lumsdaine. The parallel BGL: A generic library for distributed graph
computations. In
Parallel Object-Oriented Scientific Computing (POOSC)
, 2005.
32. C. Guo, H. Wu, K. Tan, L. Shi, Y. Zhang, and S. Lu. Dcell: A scalable and fault-tolerant
network structure for data centers.
SIGCOMM
, 38(4):75-86, 2008.
33. Hadoop. http://hadoop.apache.org/.
34. P. Harish and P. J. Narayanan. Accelerating large graph algorithms on the GPU using
CUDA. In
Proceedings of the 14th International Conference on High Performance
Computing, HiPC'07
, pages 197-208, 2007. Springer-Verlag.
35. B. He, M. Yang, Z. Guo, R. Chen, B. Su, W. Lin, and L. Zhou. Comet: Batched stream
processing for data intensive distributed computing. In
Proceedings of the 1st ACM
Symposium on Cloud Computing, SoCC'10
, pages 63-74, New York, 2010. ACM.
36. G. He, H. Feng, C. Li, and H. Chen. Parallel SimRank computation on large graphs with
iterative aggregation. In
SIGKDD
, 2010.
37. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: Distributed data-parallel
programs from sequential building blocks.
SIGOPS Oper. Syst. Rev.
, 41(3):59-72, 2007.
38. M. Isard, V. Prabhakaran, J. Currey, U. Wieder, K. Talwar, and A. Goldberg. Quincy:
Fair scheduling for distributed computing clusters. In
SOSP
, 2009.
39. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by simu-
lated annealing: An experimental evaluation. Part I, graph partitioning.
Oper. Res.
,
37(6):865-892, October 1989.
40. N. Kallen, R. Pointer, J. Kalucki, and E. Ceaser. Github. https://github.com/twitter/
flockdb, 2013.
41. S. Kandula, S. Sengupta, A. Greenberg, P. Patel, and R. Chaiken. The nature of data
center traffic: Measurements and analysis. In
IMC
, 2009.
42. 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
CMU-ML-08-117, CMU, 2008.
43. U. Kang, C. E. Tsourakakis, and C. Faloutsos. PEGASUS: A peta-scale graph min-
ing system-implementation and observations. In
Proceedings of the 2009 Ninth IEEE
International Conference on Data Mining, ICDM'09
, pages 229-238, 2009.
44. G. Karypis and V. Kumar. Parallel multilevel k-way partitioning scheme for irregu-
lar graphs. In
Proceedings of the 1996 ACM/IEEE Conference on Supercomputing,
Supercomputing'96
, 1996. IEEE Computer Society Press.
45. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning
irregular graphs.
SIAM J. Sci. Comput.
, 20(1):359-392, 1998.
46. G. Karypis and V. Kumar. A parallel algorithm for multilevel graph partitioning and
sparse matrix ordering.
J. Parallel Distrib. Comput.
, 48(1):71-95, 1998.
47. Karypis Lab.
Family of Graph and Hypergraph Partitioning Software
, 2013.
48. G. J. Katz and J. T. Kider, Jr. All-pairs shortest-paths for large graphs on the GPU. In
Graphics Hardware
, pages 47-55, 2008.
49. KEGG Laboratories. KEGG: Kyoto encyclopedia of genes and genomes. http://www.
genome.jp/kegg/kegg1.html, 2013.
50. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs.
Bell System Technical Journal
, 49(1):291-307, 1970.
Search WWH ::
Custom Search