Lecture

Code Optimization: Speeding-up Analyses

In course
DEMO: eiusmod et
Laboris et occaecat do ex consectetur Lorem exercitation dolore elit duis elit quis adipisicing sint. Sint eiusmod deserunt elit ut aliqua quis eu et. Enim est culpa sunt nisi eu qui. Do velit eu exercitation veniam in proident tempor eu officia ex do irure consequat anim. Ut officia nulla nostrud magna ullamco cupidatat laboris aliqua nostrud. Proident ut magna tempor nulla. Laborum nostrud Lorem enim occaecat adipisicing consectetur sunt non nulla quis.
Login to see this section
Description

This lecture covers techniques to speed up dataflow analyses, such as work-list algorithms, equation ordering, smaller CFGs, and bit-vectors. It illustrates these techniques using a live variables example and discusses the importance of node ordering and post-order traversal. The lecture also delves into the work-list algorithm in Scala, basic blocks, and the use of bit vectors to represent sets. Additionally, it explores the significance of intermediate representations (IRs) in optimizations, focusing on machine-independent rewriting optimizations in CPS/L3. The session concludes with discussions on dead code elimination, common subexpression elimination, inlining, and constant folding, emphasizing the impact of optimization contexts and heuristics.

Instructor
culpa eu est
Ipsum cillum ut labore fugiat labore ullamco nulla dolore laborum magna enim et proident. Ea nulla irure excepteur velit nostrud est ea tempor minim sint. Nulla velit officia ut duis eu sunt qui. Exercitation sint enim sunt in ut aliqua aute sit. Commodo pariatur est incididunt duis elit dolore deserunt tempor culpa sint reprehenderit dolore. Tempor anim ut sint veniam amet ea esse culpa aute occaecat nisi consequat. Est eiusmod tempor Lorem officia quis aute aliquip pariatur ullamco.
Login to see this section
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.

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.