World Library  
Flag as Inappropriate
Email this Article

Instruction window

Article Id: WHEBN0028915147
Reproduction Date:

Title: Instruction window  
Author: World Heritage Encyclopedia
Language: English
Subject: Parallel computing, Yield method, Parallel slowdown, Cache invalidation, Memory semantics (computing)
Collection: Computer Architecture, Instruction Processing
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Instruction window

An instruction window in computer architecture refers to the set of instructions which can execute out-of-order in an out-of-order speculative CPU.

In particular, in a conventional design, the instruction window consists of all instructions which are in the Reorder Buffer (ROB)[1] In such a processor, any instruction within the instruction window can be executed when its operands are ready. Out-of-order processors derive their name from the fact that this may occur out-of-order (if operands to a younger instruction are ready before those of an older instruction).

The instruction window has a finite size, and new instructions can enter the window (usually called dispatch or allocate) only when other instructions leave the window (usually called retire or commit). Instructions enter and leave the instruction window in program order, and an instruction can only leave the window when it is the oldest instruction in the window and it has been completed. Hence, the instruction window can be seen as a sliding window in which the instructions can become out-of-order. All execution within the window is speculative (i.e., side-effects are not applied outside the CPU) until it is committed.

This paradigm is also known as restricted dataflow[2] because instructions within the window execute in dataflow order (not necessarily in program order) but the window in which this occurs is restricted (of finite size).

Note that the instruction window is distinct from pipelining: instructions in an in-order pipeline are not in an instruction window in the conventionally understood sense, because they cannot execute out-of-order with respect to one another. Out-of-order processors are usually built around pipelines, but many of the pipeline stages (e.g., frontend instruction fetch and decode stages) are not considered to be part of the instruction window.

References

  1. ^ Shen and Lipasti. Modern Processor Design: Fundamentals of Superscalar Processors. McGraw-Hill, 2005.
  2. ^ Patt et al., HPS, A New Microarchitecture: Rationale and Introduction. In IEEE International Symposium on Microarchitecture (MICRO), 1985.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.