Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Dynamic Scheduling: Extending Pipelining for Parallelism
This lecture explores dynamic scheduling as a method to enhance pipelining by allowing instructions to be executed out of order, breaking the rigidity of traditional pipelines. It covers concepts such as reservation stations, register renaming, handling hazards, and precise exceptions. The instructor discusses how dynamic scheduling enables the extraction of parallelism, resolves data hazards, and improves performance by breaking the strict sequencing of instructions.
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