![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Journal of Instruction-Level Parallelism, Volume 2
Volume 2, 2000
- Kevin Skadron, Margaret Martonosi, Douglas W. Clark:
Speculative Updates of Local and Global Branch History: A Quantitative Analysis. - Brad Calder, Glenn Reinman:
A Comparative Survey of Load Speculation Architectures. - Ilan Y. Spillinger, Chris J. Newburn:
Guest Editors' Introduction. - Eric Rotenberg, James E. Smith:
Control Independence in Trace Processors. - Andreas Moshovos, Gurindar S. Sohi:
Memory Dependence Prediction in Multimedia Applications. - Vijay S. Pai, Sarita V. Adve:
Code Transformations to Improve Memory Parallelism. - Jay Bharadwaj, Kishore N. Menezes, Chris McKinsey:
Wavefront Scheduling: Path Based Data Representation and Scheduling of Subgraphs. - Andrew Wolfe, Derek B. Noonburg:
A Superscalar 3D Graphics Engine. - David H. Albonesi:
Selective Cache Ways: On-Demand Cache Resource Allocation. - Teresa Monreal, Antonio González, Mateo Valero, José González, Víctor Viñals:
Dynamic Register Renaming Through Virtual-Physical Registers. - Todd M. Austin:
DIVA: A Dynamic Approach to Microprocessor Verification. - Serap A. Savari, Cliff Young:
Comparing and Combining Profiles. - Zheng Wang, Ken Pierce, Scott McFarling:
BMAT - A Binary Matching Tool for Stale Profile Propagation. - Robert S. Cohn, P. Geoffrey Lowney:
Design and Analysis of Profile-Based Optimization in Compaq's Compilation Tools for Alpha.
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.