Abstract
Trace cache performance is limited by two types of redundancy: duplication and liveness. In this paper, we show that duplication is not strongly correlated to trace cache performance. Generally, the best-performing trace caches also introduce the most duplication. The amount of dead traces is extremely high, ranging from 76% in the smallest trace cache to 35% in the largest trace cache studied. Furthermore, most of these dead traces are never used between storing them and replacing them from the trace cache.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Peleg and U. Weiser, “Dynamic flow instruction cache memory organized around trace segments independent of virtual address line,” U.S. Patent Number 5.381.533, Jan. 1995.
E. Rotenberg, S. Bennett, and J. E. Smith, “Trace cache: A low latency approach to high bandwidth instruction fetching,” in Proceedings of the 29th Conference on Microprogramming and Microarchitecture, pp. 24–35, Dec. 1996.
A. Ramírez, J. Larriba-Pey, C. Navarro, J. Torrella, and M. Valero, “Software trace cache,” in ICS’99. Proceedings of the 1999 International Conference on Supercomputing, June 1999.
A. Ramírez, J. Larriba-Pey, and M. Valero, “Trace cache redundancy: Red & blue traces,” in Proceedings of the 6th International Symposium on High Performance Computer Architecture, Jan. 2000.
S. Patel, M. Evers, and Y. Patt, “Improving trace cache effectiveness with branch promotion and trace packing,” in Proceedings of the 25th Annual International Sym-posium on Computer Architecture, pp. 262–271, June 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vandierendonck, H., Ramírez, A., De Bosschere, K., Valero, M. (2002). A Comparative Study of Redundancy in Trace Caches. In: Monien, B., Feldmann, R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_69
Download citation
DOI: https://doi.org/10.1007/3-540-45706-2_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44049-9
Online ISBN: 978-3-540-45706-0
eBook Packages: Springer Book Archive