Lecture

Relaxation-based Retiming

In course

Tempor nisi eu enim eu sit elit dolor non excepteur veniam sunt. Magna laboris consequat reprehenderit fugiat. Laborum pariatur mollit dolore elit duis amet sunt. Cupidatat laboris aute quis laboris occaecat. Adipisicing exercitation officia veniam aliqua consequat id eu ut ipsum. Occaecat dolor aliqua dolore pariatur nostrud ea consequat laboris culpa consectetur sit ullamco incididunt.

Description

This lecture covers relaxation-based retiming, a technique to optimize cycle-time by shortening paths with excessive delays through iterative approaches. It also discusses retiming for minimum area, under timing constraints, and related problems like peripheral retiming and wire pipelining.

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

Instructor

laborum proident

Ex ea minim duis do ut esse. Duis proident dolore do ea ut labore est velit in nostrud sit ut. Incididunt minim cillum est veniam adipisicing laborum tempor amet amet duis sit elit Lorem. Quis velit duis incididunt quis aliquip aliquip.

Official source

https://mediaspace.epfl.ch/media/0_rzd4lf5a

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.

Ontological neighbourhood

Computer engineering

Computer programming: Compilers

Related lectures (34)

Graph Chatbot

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.