Abstract
The dynamic instruction scheduling logic (the issue queue and the associated control logic) forms the core of an out-of-order microprocessor. Traditional scheduling mechanisms, based on tag broadcasts and associative tag matching logic within the issue queue are limited by high power consumption, large access delay and poor scalability. To address these inefficiencies, researchers have proposed various flavors of so-called wakeup-free scheduling logic. Such wakeup-free scheduling techniques remove the wakeup delay from the critical path, but incur other forms of complexity, essentially stemming from the need to keep track of the cycle when each physical register will become ready and when each instruction can be (speculatively) issued. We propose instruction recirculation– a wakeup-free instruction scheduler design that completely eliminates all counting and issue time estimation logic inherent in all previously proposed wakeup-free schedulers. This complexity reduction is also accompanied by 3.6% IPC improvement over the state-of-the-art wakeup-free scheduler.
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
Abella, J., Gonzalez, A.: Low-Complexity Distributed Issue Queue. In: HPCA (2004)
Brekelbaum, E., et al.: Hierarchical Scheduling Windows. In: Proc. of MICRO (2002)
Brown, M., Stark, J., Patt, Y.: Select-Free Instruction Scheduling Logic. In: The 34th International Symposium on Microarchitecture (2001)
Burger, D., Austin, T.: The SimpleScalar tool set: V. 2.0, Tech. Report, Dept. of CS, Univ. of Wisconsin-Madison, and documentation for all Simplescalar releases (June 1997)
Canal, R., Gonzalez, A.: A Low-Complexity Issue Logic. In: Proc. of the International Conference on Supercomputing, ICS (2000)
Canal, R., Gonzalez, A.: Reducing the Complexity of the Issue Logic. In: Proc, of the Int’l. Conf. on Supercomputing, ICS (2001)
Cristal, A., et al.: Out-of-Order Commit Processors. In: Proc. of HPCA (2004)
Ehrhart, T., Patel, S.: Reducing the Scheduling Critical Cycle using Wakeup Prediction. In: HPCA (2004)
Ernst, D., Hamel, A., Austin, T.: Cyclone: a Broadcast-free Dynamic Instruction Scheduler with Selective Replay. In: Proc. of Int’l. Symp. On Computer Architecture, ISCA (2003)
Ernst, D., Austin, T.: Efficient Dynamic Scheduling Through Tag Elimination. In: The 29th Int’l. Symp. on Comp. Architecture (2002)
Gowan, M.K., Biro, L.L., Jackson, D.B.: Power considerations in the Design of the Alpha 21264 microprocessor. In: The Proceedings of the 35th ACM/IEEE Design Automation Conference, DAC 1998 (1998)
Hu, J., Vijaykrishnan, N., Irwin, M.: Exploring Wakeup-Free Instruction Scheduling. In: Proc. of the Int’l. Symp. on High Perf. Computer Architecture, HPCA (2004)
Kim, I., Lipasti, M.: Half-Price Architecture. In: Proceedings of ISCA (2002)
Kim, I., Lipasti, M.: Macro-Op Scheduling: Relaxing Scheduling Loop Constraints. In: The 36th International Symposium on Microarchitecture (2003)
Lebeck, A., et al.: A Large, Fast Instruction Window for Tolerating Cache Misses. In: The 29th Intl. Symp. on Comp. Arch, ISCA (2002)
Liu, Y., et al.: Scaling the Issue Window with Look-Ahead Latency Prediction. In: ICS 2004 (2004)
Michaud, P., Seznec, A.: Data-Flow Prescheduling for Large Instruction Windows in Outof- Order Processors. In: HPCA (2001)
Palacharla, S., et al.: Complexity-Effective Superscalar Processors. In: ISCA 1997 (1997)
Raasch, S., Binkert, N., Reinhardt, S.: A Scalable Instruction Queue Design Using Dependence Chains. In: Proc. of ISCA (2002)
Sharkey, J., et al.: Instruction Packing: Reducing Power and Delay of the Dynamic Scheduling Logic. In: Proc. ISLPED 2005 (2005)
Sharkey, J., Ponomarev, D.: Non-Uniform Instruction Scheduling. In: Proc. Euro-Par (2005)
Stark, J., Brown, M., Patt, Y.: On Pipelining Dynamic Instruction Scheduling Logic. In: 33rd Int’l. Symp. on Microarchitecture (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sharkey, J.J., Ponomarev, D.V. (2005). Instruction Recirculation: Eliminating Counting Logic in Wakeup-Free Schedulers. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_62
Download citation
DOI: https://doi.org/10.1007/11549468_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)