Program generation for the all-pairs shortest path problem
暂无分享,去创建一个
[1] Andrew V. Goldberg,et al. Computing the shortest path: A search meets graph theory , 2005, SODA '05.
[2] Yuefan Deng,et al. New trends in high performance computing , 2001, Parallel Computing.
[3] Matteo Frigo,et al. A fast Fourier transform compiler , 1999, SIGP.
[4] Steven G. Johnson,et al. The Design and Implementation of FFTW3 , 2005, Proceedings of the IEEE.
[5] Giuseppe F. Italiano,et al. A new approach to dynamic all pairs shortest paths , 2003, STOC '03.
[6] Jacobus P. H. Wessels,et al. The art and theory of dynamic programming , 1977 .
[7] John Moy,et al. OSPF Version 2 , 1998, RFC.
[8] Jack J. Dongarra,et al. Automated empirical optimizations of software and the ATLAS project , 2001, Parallel Comput..
[9] David E. Bernholdt,et al. Synthesis of High-Performance Parallel Programs for a Class of ab Initio Quantum Chemistry Models , 2005, Proceedings of the IEEE.
[10] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[11] Victor Eijkhout,et al. Self-Adapting Linear Algebra Algorithms and Software , 2005, Proceedings of the IEEE.
[12] Gang Ren,et al. Is Search Really Necessary to Generate High-Performance BLAS? , 2005, Proceedings of the IEEE.
[13] Franz Franchetti,et al. SPIRAL: Code Generation for DSP Transforms , 2005, Proceedings of the IEEE.
[14] Sartaj Sahni,et al. A blocked all-pairs shortest-paths algorithm , 2003, ACM J. Exp. Algorithmics.
[15] References , 1971 .
[16] Richard W. Vuduc,et al. Sparsity: Optimization Framework for Sparse Matrix Kernels , 2004, Int. J. High Perform. Comput. Appl..
[17] Michael Elkin,et al. Computing almost shortest paths , 2001, TALG.
[18] Viktor K. Prasanna,et al. Optimizing graph algorithms for improved cache performance , 2002, IEEE Transactions on Parallel and Distributed Systems.
[19] Robert A. van de Geijn,et al. FLAME: Formal Linear Algebra Methods Environment , 2001, TOMS.
[20] Robert A. van de Geijn,et al. The science of deriving dense linear algebra algorithms , 2005, TOMS.