AN ANALYSIS OF THE COMPUTATIONAL AND PARALLEL COMPLEXITY OF THE LIVERMORE LOOPS

This paper presents and analyzes the computational and parallel complexity of the Livermore Loops. The Loops represent the type of computational kernels typically found in large-scale scientific computing and have been used to benchmark computer systems since the mid-60's. On parallel systems, a process's computational structure can greatly affect its efficiency. It the Loops are to be used to benchmark such systems, their computations must be understood thoroughly, so that efficient implementations may be written. This paper addresses that concern.