Dynamic Scheduling

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.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (23)

Related concepts (70)

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.

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.

Data parallelism

Data parallelism is parallelization across multiple processors in parallel computing environments. It focuses on distributing the data across different nodes, which operate on the data in parallel. It can be applied on regular data structures like arrays and matrices by working on each element in parallel. It contrasts to task parallelism as another form of parallelism. A data parallel job on an array of n elements can be divided equally among all the processors.

Task parallelism

Task parallelism (also known as function parallelism and control parallelism) is a form of parallelization of computer code across multiple processors in parallel computing environments. Task parallelism focuses on distributing tasks—concurrently performed by processes or threads—across different processors. In contrast to data parallelism which involves running the same task on different components of data, task parallelism is distinguished by running many different tasks at the same time on the same data.

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.

CS-209: Computer architecture II

The course completes the introduction to computer architecture.

MIPS ISA: Instruction Classes and Addressing Modes CS-208: Computer architecture I

Explores MIPS ISA instruction classes, memory organization, and addressing modes, including examples and endianness.

Designing Datapath and Control Logic for ISA Instructions

Explores the design of datapath and control logic for executing ISA instructions, focusing on hardwired control and performance analysis.

Introduction to Processors CS-208: Computer architecture I

Covers the fundamentals of processors, from digital logic to program execution, including components like ALU, register file, and control logic.

Untitled CS-470: Advanced computer architecture

GPUs: Multithreading and Architecture CS-471: Advanced multiprocessor architecture

Explores GPUs' architecture, multithreading, and their role in machine learning, discussing limitations and future trends.