论文信息 - A Unified Framework for Numerical and Combinatorial Computing

A Unified Framework for Numerical and Combinatorial Computing

A rich variety of tools help researchers with high-performance numerical computing, but few tools exist for large-scale combinatorial computing. The authors describe their efforts to build a common infrastructure for numerical and combinatorial computing by using parallel sparse matrices to implement parallel graph algorithms.

John R. Gilbert | Steven P. Reinhardt | Viral B. Shah | J. Gilbert

[1] John R. Gilbert,et al. An interactive system for combinatorial scientific computing with an emphasis on programmer productivity , 2007 .

[2] Baruch Awerbuch,et al. New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM , 1987, IEEE Transactions on Computers.

[3] John R. Gilbert,et al. An Interactive Environment to Manipulate Large Graphs , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[4] John R. Gilbert,et al. Sparse Matrices in MATLAB: Design and Implementation , 1992, SIAM J. Matrix Anal. Appl..

[5] B. Mcrae,et al. ISOLATION BY RESISTANCE , 2006, Evolution; international journal of organic evolution.

[6] John K. Reid,et al. Algorithm 529: Permutations To Block Triangular Form [F1] , 1978, TOMS.

[7] John R. Gilbert,et al. Predicting fill for sparse orthogonal factorization , 1986, JACM.

[8] John R. Gilbert,et al. Sparse Matrices in Matlab*P: Design and Implementation , 2004, HiPC.

[9] J. Gilbert. Predicting Structure in Sparse Matrix Computations , 1994 .

[10] Robert D. Falgout,et al. hypre: A Library of High Performance Preconditioners , 2002, International Conference on Computational Science.

[11] John R. Gilbert,et al. High-Performance Graph Algorithms from Parallel Sparse Matrices , 2006, PARA.