Mod-10 Lec-17 Machine-Independent Optimizations-Part 2

Course Lectures

• Mod-01 Lec-01 An Overview of a Compiler

  Prof. Y.N. Srikanth

  Play
• Mod-02 Lec-02 An Overview of a Compilier-Part 2 and Run-Time Environments

  Prof. Y.N. Srikanth

  Play
• Mod-02 Lec-03 Run-time Environments-Part 2

  Prof. Y.N. Srikanth

  Play
• Mod-03 Lec-04 Run-time Environments-Part 3 and Local Optimizations

  Prof. Y.N. Srikanth

  Play
• Mod-03 Lec-05 Local Optimizations-Part 2 and Code Generation

  Prof. Y.N. Srikanth

  Play
• Mod-04 Lec-06 Code Generation

  Prof. Y.N. Srikanth

  Play
• Mod-04 Lec-07 Code Generation-Part 2

  Prof. Y.N. Srikanth

  Play
• Mod-05 Lec-08 Code Generation-Part 3 and Global Register Allocation

  Prof. Y.N. Srikanth

  Play
• Mod-05 Lec-09 Global Register Allocation-Part 2

  Prof. Y.N. Srikanth

  Play
• Mod-05 Lec-10 Global Register Allocation-Part 3 and Implementing Object-Oriented Languages

  Prof. Y.N. Srikanth

  Play
• Mod-07 Lec-11 Implementing Object-Oriented Languages-Part2 and Introduction to Machine-Indep Opt.,

  Prof. Y.N. Srikanth

  Play
• Mod-07 Lec-12 Introduction to Machine-Independent Optimizations-Part 2 Data-flow Analysis

  Prof. Y.N. Srikanth

  Play
• Mod-08 Lec-13 Data-flow Analysis-Part 2

  Prof. Y.N. Srikanth

  Play
• Mod-09 Lec-14 Data-flow Analysis - Part 3 Control Flow Analysis

  Prof. Y.N. Srikanth

  Play
• Mod-09 Lec-15 Control Flow Analysis-Part2

  Prof. Y.N. Srikanth

  Play
• Mod-10 Lec-16 Machine-Independent Optimizations

  Prof. Y.N. Srikanth

  Play
• Mod-10 Lec-17 Machine-Independent Optimizations-Part 2

  Prof. Y.N. Srikanth

  Playing
• Mod-11 Lec-18 Machine-Independent Optimizations-Part 3 and Data-flow Analysis:Theoretical Foundation

  Prof. Y.N. Srikanth

  Play
• Mod-11 Lec-19 Data-flow Analysis:Theoretical Foundation-Part 2 and Partial Redundancy Elimination

  Prof. Y.N. Srikanth

  Play
• Mod-12 Lec-20 Partial Redundancy Elimination

  Prof. Y.N. Srikanth

  Play
• Mod-13 Lec-21 The Static Single Assignment Form:Construction and Application to Program

  Prof. Y.N. Srikanth

  Play
• Mod-13 Lec-22 The Static Single Assignment Form: Construction and Application to Program

  Prof. Y.N. Srikanth

  Play
• Mod-13 Lec-23 The StaticSingle Assignment Form:Construction and Applicationto Program Optimizations

  Prof. Y.N. Srikanth

  Play
• Mod-14 Lec-24 Automatic Parallelization

  Prof. Y.N. Srikanth

  Play
• Mod-14 Lec-25 Automatic Parallelization-Part 2

  Prof. Y.N. Srikanth

  Play
• Mod-14 Lec-26 Automatic Parallelization-Part 3

  Prof. Y.N. Srikanth

  Play
• Mod-14 Lec-27 Automatic Parallelization-Part 4

  Prof. Y.N. Srikanth

  Play
• Mod-15 Lec-28 Instruction Scheduling

  Prof. Y.N. Srikanth

  Play
• Mod-15 Lec-29 Instruction Scheduling-Part 2

  Prof. Y.N. Srikanth

  Play
• Mod-15 Lec-30 Instruction Scheduling-Part 3

  Prof. Y.N. Srikanth

  Play
• Mod-16 Lec-31 Software Pipelining

  Prof. Y.N. Srikanth

  Play
• Mod-17 Lec-32 Energy-Aware Software Systems

  Prof. Y.N. Srikanth

  Play
• Mod-17 Lec-33 Energy-Aware Software Systems-Part 2

  Prof. Y.N. Srikanth

  Play
• Mod-17 Lec-34 Energy-Aware Software System-Part 3

  Prof. Y.N. Srikanth

  Play
• Mod-17 Lec-35 Energy-Aware Software System-Part 4

  Prof. Y.N. Srikanth

  Play
• Mod-18 Lec-36 Just-In-Time Compilation and Optimizations for .NET CLR

  Prof. Y.N. Srikanth

  Play
• Mod-19 Lec-37 Garbage Collection

  Prof. Y.N. Srikanth

  Play
• Mod-20 Lec-38 Interprocedural Data-Flow analysis

  Prof. Y.N. Srikanth

  Play
• Mod-21 Lec-39 Worst Case Execution Time

  Prof. Y.N. Srikanth

  Play
• Mod-21 Lec-40 Worst Case Execution Time - Part 2

  Prof. Y.N. Srikanth

  Play