Getov, Vladimir (1996) Benchmarking the cache memory effect. In: Dongarra, Jack and Madsen, Kaj and Wasniewski, Jerzy, (eds.) Applied Parallel Computing Computations in Physics, Chemistry and Engineering Science:. Lecture notes in computer science (1041). Springer, Berlin ; London, pp. 233-246. ISBN 9783540609025
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3-540-60902-4_27
A new performance model of the memory hierarchy is first introduced, which describes all possible scenarios for the calculation process, including the important case when the cache memory is bypassed. A detailed study of each scenario is then given along with the derivation of corresponding formulae. In these formulae the cache load time associated with the penalty which must be paid to transfer data between the main memory and the cache is also taken into account. A two-parameter linear model for performance characterisation of cache memory effect is introduced. The double-performance parameter, n2 is defined to describe the performance degradation for problem sizes that do not fit into the cache memory. This parameter determines the problem size required to preserve twice the asymptotic performance. Excellent agreement is shown between the estimated performance figures and several benchmark measurements on iPSC/860. The results presented here were previously published in an extended version of this article which appeared in Supercomputer 63, vol XI (5), 1995. They are re-produced with kind permission of ASFRA BV, The Netherlands.
|Item Type:||Book Section|
|Research Community:||University of Westminster > Electronics and Computer Science, School of|
|Deposited On:||11 Feb 2010 17:31|
|Last Modified:||11 Feb 2010 17:31|
Repository Staff Only: item control page