Performance: Hardware and Software Optimization

This lecture delves into the evolution of performance metrics in computing, comparing historical systems like VAX-11/780 to modern processors. It explores the impact of processor frequency, memory speed, cache efficiency, and the importance of execution time. The lecture discusses the concept of speedup, cycles per instruction (CPI), and instructions per cycle (IPC) to improve performance. It also covers Amdahl's Law, benchmarks like SPEC CPU2006, and the relationship between hardware implementation and performance. The instructor emphasizes the significance of architectural and organizational ideas in driving performance improvements since the mid-1980s.

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 (20)

Related concepts (65)

CS-209: Computer architecture II

The course completes the introduction to computer architecture.

Speedup

In computer architecture, speedup is a number that measures the relative performance of two systems processing the same problem. More technically, it is the improvement in speed of execution of a task executed on two similar architectures with different resources. The notion of speedup was established by Amdahl's law, which was particularly focused on parallel processing. However, speedup can be used more generally to show the effect on performance after any resource enhancement.

Program optimization

In computer science, program optimization, code optimization, or software optimization, is the process of modifying a software system to make some aspect of it work more efficiently or use fewer resources. In general, a computer program may be optimized so that it executes more rapidly, or to make it capable of operating with less memory storage or other resources, or draw less power. Although the word "optimization" shares the same root as "optimal", it is rare for the process of optimization to produce a truly optimal system.

Amdahl's law

In computer architecture, Amdahl's law (or Amdahl's argument) is a formula which gives the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved. It states that "the overall performance improvement gained by optimizing a single part of a system is limited by the fraction of time that the improved part is actually used". It is named after computer scientist Gene Amdahl, and was presented at the American Federation of Information Processing Societies (AFIPS) Spring Joint Computer Conference in 1967.

Object code optimizer

An object code optimizer, sometimes also known as a post pass optimizer or, for small sections of code, peephole optimizer, forms part of a software compiler. It takes the output from the source language compile step - the object code or - and tries to replace identifiable sections of the code with replacement code that is more algorithmically efficient (usually improved speed). The earliest "COBOL Optimizer" was developed by Capex Corporation in the mid 1970s for COBOL.

Peephole optimization

Peephole optimization is an optimization technique performed on a small set of compiler-generated instructions; the small set is known as the peephole or window. Peephole optimization involves changing the small set of instructions to an equivalent set that has better performance.

Rescuing Data Center Processors

Explores challenges and solutions for data center processors, focusing on efficiency, cache issues, branch prediction, and architectural optimizations.

On-Board Computers: Microprocessors and Microcontrollers EE-583: Spacecraft avionics architectures

Covers spacecraft avionics systems, architectures, and processors, focusing on on-board computers and microprocessors.

Efficient GPU Join Optimization

Discusses efficient GPU-accelerated join optimization for complex queries, aiming to improve optimization times and heuristic plan quality.

VLIW: Dynamically Scheduled Processors CS-209: Computer architecture II

Explores VLIW processors, focusing on scheduling complexity, ILP limitations, and code bloating.

Performance: Hardware and Software Optimization CS-200: Computer architecture

Explores hardware and software optimization for system performance, emphasizing the importance of reducing delay per gate and improving architecture.