Modeling Algorithm Performance on Highly-threaded Many-core Architectures
作者： Lin Ma
DOI: 10.7936/K73X84SG
关键词: Shortest path problem 、 Computational science 、 Computer science 、 Parallel computing 、 Performance model 、 Many core
摘要:
sci-hub.st 参考文章(148)
Kjell Bratbergsengen, Hashing Methods and Relational Algebra Operations very large data bases. pp. 323- 333 ,(1984)
Pedro J. Martín, Roberto Torres, Antonio Gavilanes, CUDA Solutions for the SSSP Problem international conference on computational science. pp. 904- 913 ,(2009) , 10.1007/978-3-642-01970-8_91
Pawan Harish, P. J. Narayanan, Accelerating Large Graph Algorithms on the GPU Using CUDA High Performance Computing – HiPC 2007. pp. 197- 208 ,(2007) , 10.1007/978-3-540-77220-0_21
Richard M Karp, None, A Survey of Parallel Algorithms for Shared-Memory Machines University of California at Berkeley. ,(1988)
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
James Christopher Wyllie, The Complexity of Parallel Computations The Complexity of Parallel Computations. pp. 123- 123 ,(1979)
R. Solovay, V. Strassen, A Fast Monte-Carlo Test for Primality SIAM Journal on Computing. ,vol. 6, pp. 84- 85 ,(1977) , 10.1137/0206006
Lester Randolph Ford, Flows in networks ,(1962)
S Solomon, P Thulasiraman, R K Thulasiram, Exploiting Parallelism in Iterative Irregular Maxflow Computations on GPU Accelerators high performance computing and communications. pp. 297- 304 ,(2010) , 10.1109/HPCC.2010.44
Patrick Valduriez, Georges Gardarin, Join and Semijoin Algorithms for a Multiprocessor Database Machine ACM Transactions on Database Systems. ,vol. 9, pp. 133- 161 ,(1984) , 10.1145/348.318590