An analysis of the computational and parallel complexity of the Livermore Loops
作者： John T Feo
DOI: 10.1016/0167-8191(88)90037-3
关键词:
摘要: Abstract This paper presents and analyzes the computational parallel complexity of Livermore Loops. The Loops represent type kernels typically found in large-scale scientific computing have been used to benchmark computer system since mid-60's. On systems, a process's structure can greatly affect its efficiency. If loops are be such their computations must understood thoroughly, so that efficient implementations may written. addresses concern.
elsevier.com
sci-hub.se 参考文章(6)
Clifford N. Arnold, Performance evaluation of three automatic vectorizer packages. international conference on parallel processing. pp. 235- 242 ,(1982)
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
Peter M. Kogge, Harold S. Stone, A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations IEEE Transactions on Computers. ,vol. C-22, pp. 786- 793 ,(1973) , 10.1109/TC.1973.5009159
D. J. Kuck, R. H. Kuhn, D. A. Padua, B. Leasure, M. Wolfe, Dependence graphs and compiler optimizations symposium on principles of programming languages. pp. 207- 218 ,(1981) , 10.1145/567532.567555
F. H. Mcmahon, The Livermore Fortran Kernels: A Computer Test of the Numerical Performance Range Technical Report UCRL-53745. ,(1986)
P. M. Kogge, Parallel Solution of Recurrence Problems IBM Journal of Research and Development. ,vol. 18, pp. 138- 148 ,(1974) , 10.1147/RD.182.0138