On the representation and multiplication of hypersparse matrices

IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM

Volumn , Issue , 2008, Pages

  Buluç, Aydin ^a   Gilbert, John R ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; DATA STRUCTURES; DISTRIBUTED PARAMETER NETWORKS; FILE ORGANIZATION; ONLINE SEARCHING; SEQUENTIAL SWITCHING;

PARALLEL AND DISTRIBUTED PROCESSING; PARALLEL SPARSE MATRIX; SPARSE MATRICES;

MATRIX ALGEBRA;

EID: 51049121603     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2008.4536313     Document Type: Conference Paper

References (30)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1974.
2. B.W. Bader and T. G. Kolda. EfficientMatlab computations with sparse and factored tensors. SIAM Journal on Scientific Computing, 30(1):205-231, 2007.
3. D. Bader, J. Feo, J. Gilbert, J. Kepner, D. Koester, E. Loh, K. Madduri, B. Mann, and T. Meuse. HPCS scalable synthetic compact applications #2. version 1.1.
4. M. A. Bender, G. S. Brodal, R. Fagerberg, R. Jacob, and E. Vicari. Optimal sparse matrix dense vector multiplication in the I/O-model. In SPAA '07: Proceedings of the nineteenth annual ACM symposium on parallel algorithms and architectures, pages 61-70, New York, NY, USA, 2007. ACM Press.
5. T. Bennouas and F. de Montgolfier. Random web crawls. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 451-460, New York, NY, USA, 2007. ACM Press.
6. D. Coppersmith and S.Winograd. Matrix multiplication via arithmetic progressions. In STOC '87: Proceedings of the nineteenth annual ACM conference on theory of computing, pages 1-6, New York, NY, USA, 1987. ACM Press.
7. T. A. Davis. Direct Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2006.
8. I. S. Duff, M. A. Heroux, and R. Pozo. An overview of the sparse basic linear algebra subprograms: The new standard from the blas technical forum. ACM Transactions on Mathematical Software, 28(2):239-267, 2002.
9. R. A. V. D. Geijn and J.Watts. SUMMA: Scalable universal matrix multiplication algorithm. Concurrency: Practice and Experience, 9(4):255-274, 1997.
10. J. R. Gilbert, G. L. Miller, and S.-H. Teng. Geometric mesh partitioning: Implementation and experiments. SIAM Journal on Scientific Computing, 19(6):2091-2110, 1998.
11. J. R. Gilbert, C. Moler, and R. Schreiber. Sparse matrices in Matlab: Design and implementation. SIAM Journal of Matrix Analysis and Applications, 13(1):333-356, 1992.
12. F. G. Gustavson. Two fast algorithms for sparse matrices: Multiplication and permuted transposition. ACM Transactions on Mathematical Software, 4(3):250-269, 1978.
13. J. Irwin, J.-M. Loingtier, J. R. Gilbert, G. Kiczales, J. Lamping, A. Mendhekar, and T. Shpeisman. Aspect-oriented programming of sparse matrix code. In ISCOPE '97: Proceedings of the Scientific Computing in Object-Oriented Parallel Environments, pages 249-256, London, UK, 1997. Springer-Verlag.
14. H. Kaplan, M. Sharir, and E. Verbin. Colored intersection searching via sparse rectangular matrix multiplication. In SCG '06: Proceedings of the twenty-second annual symposium on computational geometry, pages 52-60, New York, NY, USA, 2006. ACM Press.
15. D. E. Knuth. The art of computer programming, volume 1 (3rd ed.): Fundamental algorithms. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1997.
16. J. Leskovec, D. Chakrabarti, J. M. Kleinberg, and C. Faloutsos. Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In PKDD, pages 133-145, 2005.
17. A. Lumsdaine, D. Gregor, B. Hendrickson, and J. Berry. Challenges in parallel graph processing. Parallel Processing Letters, 17(1):5-20, 2007 2007.
18. B. M. Maggs and S. A. Poltkin. Minimum-cost spanning tree as a path-finding problem. Information Processing Letters, 26(6):291-293, 1988.
19. P. os and A. Rényi. On random graphs. Publicationes Mathematicae, 6(1):290-297, 1959.
20. S. C. Park, J. P. Draayer, and S.-Q. Zheng. Fast sparse matrix multiplication. Computer Physics Communications, 70:557-568, July 1992.
21. G. Penn. Efficient transitive closure of sparse matrices over closed semirings. Theoretical Computer Science, 354(1):72-81, 2006.
22. M. O. Rabin and V. V. Vazirani. Maximum matchings in general graphs through randomization. Journal of Algorithms, 10(4):557-567, 1989.
23. P. Sanders. Fast priority queues for cached memory. Journal of Experimental Algorithmics, 5:7, 2000.
24. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. Journal of Computer and System Sciences, 51(3):400-403, 1995.
25. P. Sulatycke and K. Ghose. Caching-efficient multithreaded fast multiplication of sparse matrices. In IPPS '98: Proceedings of the 12th. International Parallel Processing Symposium, page 117,Washington, DC, USA, 1998. IEEE Computer Society.
26. R. E. Tarjan. A unified approach to path problems. Journal of the ACM, 28(3):577-593, 1981.
27. 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 SC '05: Proceedings of the 2005 ACM/IEEE conference on Supercomputing, page 25, Washington, DC, USA, 2005. IEEE Computer Society.
28. R. Yuster and U. Zwick. Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. In SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, pages 254-260, Philadelphia, PA, USA, 2004. Society for Industrial and Applied Mathematics.
29. R. Yuster and U. Zwick. Fast sparse matrix multiplication. ACM Trans. Algorithms, 1(1):2-13, 2005.
30. U. Zwick. All pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM, 49(3):289-317, 2002.