Abstract
The memory system has become a key factor to get high performance, especially for those numerical programs. Along with the increasing gap between processors and memories, the traditional calculation complexity analysis is now not sufficient to judge an algorithm or program. The memory complexity also plays an important role. In this paper, a model based on the memory hierarchy technology was proposed to analyze the memory complexity for circular sentences, which are normally the most time-consuming part for numerical programs, and therefore to judge and predict its performance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Memik, G., Kandemir, M., Choudhary, A., Kadayif, I.: An Integrated Approach for Improving Cache Behavior. IEEE, 1530–1591 (March 2003)
Catthoor, F., Wuytack, S., Greef, E.D., Ba, F.: Custom memory management methodology – exploration of memory organization for embedded multimedia system design. Kluwer Academic Publishers (June 1998)
Anderson Jennifer, M., Amarasinghe Saman, P., Lam monica S.: Data and computation transformations for multiProcess- ors. In: Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 1995), Santa Barbara, CA, pp. 166–178 (1995)
Wolf, M.E.: Improving locality and parallelism in nested loops(Ph D dissertation). Department of Computer Science, Stanford University (1992)
Demmel, J.W.: Applied Numerical Linear Algebra. SIAM Press, Piladelphia (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Yan, X.H. (2012). A Memory Complexity Model for Circular Sentences. In: Hu, W. (eds) Advances in Electric and Electronics. Lecture Notes in Electrical Engineering, vol 155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28744-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-28744-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28743-5
Online ISBN: 978-3-642-28744-2
eBook Packages: EngineeringEngineering (R0)