Lecture

Dynamic Scheduling

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture covers the concept of dynamic scheduling in processor design, aiming to increase parallelism by executing instructions out of order. It discusses breaking the rigidity of basic pipelining, reservation stations, register renaming, and handling exceptions. The lecture also explains in-order and out-of-order completion, WAW and WAR data hazards, and the use of a reorder buffer. It concludes with the implementation of load-store queues and the tangible benefits of dynamic scheduling in terms of instruction-level parallelism.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Ontological neighbourhood

Computer engineering

Hardware engineering: Microprocessors

Related concepts (32)

In computer architecture, register renaming is a technique that abstracts logical registers from physical registers. Every logical register has a set of physical registers associated with it. When a machine language instruction refers to a particular logical register, the processor transposes this name to one specific physical register on the fly. The physical registers are opaque and cannot be referenced directly but only via the canonical names.

Instruction-level parallelism

Instruction-level parallelism (ILP) is the parallel or simultaneous execution of a sequence of instructions in a computer program. More specifically ILP refers to the average number of instructions run per step of this parallel execution. ILP must not be confused with concurrency. In ILP there is a single specific thread of execution of a process. On the other hand, concurrency involves the assignment of multiple threads to a CPU's core in a strict alternation, or in true parallelism if there are enough CPU cores, ideally one core for each runnable thread.

A register file is an array of processor registers in a central processing unit (CPU). Register banking is the method of using a single name to access multiple different physical registers depending on the operating mode. Modern integrated circuit-based register files are usually implemented by way of fast static RAMs with multiple ports. Such RAMs are distinguished by having dedicated read and write ports, whereas ordinary multiported SRAMs will usually read and write through the same ports.

Out-of-order execution

In computer engineering, out-of-order execution (or more formally dynamic execution) is a paradigm used in most high-performance central processing units to make use of instruction cycles that would otherwise be wasted. In this paradigm, a processor executes instructions in an order governed by the availability of input data and execution units, rather than by their original order in a program. In doing so, the processor can avoid being idle while waiting for the preceding instruction to complete and can, in the meantime, process the next instructions that are able to run immediately and independently.

Processor register

A processor register is a quickly accessible location available to a computer's processor. Registers usually consist of a small amount of fast storage, although some registers have specific hardware functions, and may be read-only or write-only. In computer architecture, registers are typically addressed by mechanisms other than main memory, but may in some cases be assigned a memory address e.g. DEC PDP-10, ICT 1900.

Related lectures (64)

VLIW Architectures: Compilers and Instruction Level Parallelism

Covers VLIW architectures and compilers, focusing on instruction level parallelism and optimization techniques.

Dynamic Scheduling in Processors: Enhancing Instruction Execution

Covers dynamic scheduling in processors, focusing on out-of-order execution and managing instruction dependencies effectively.

Understanding Simultaneous Multithreading in Modern Processors

Covers simultaneous multithreading, its implementation, and its impact on processor performance.

Covers register renaming techniques essential for eliminating execution hazards in modern processors.

Pipelining: Enhancing Computer Architecture Performance

Covers pipelining in computer architecture, focusing on its role in enhancing performance through instruction-level parallelism and addressing associated challenges.

Related concepts (32)

Instruction-level parallelism

Out-of-order execution

Processor register