Lecture

Performance: Software Engineering

Graph Chat

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.

In course

CS-305: Software engineering

This course teaches the basics of modern software development: designing software, working in a team, writing good code, shipping software, and evolving software. It emphasizes building software that meets high standards of quality, reliability, security, ...

Description

This lecture covers the definition and quantification of performance, measurement techniques, setting performance goals, and improving software performance. Topics include Amdahl's Law, distribution of latencies, dealing with performance in practice, and strategies like caching, batching, laziness, and speculation. The instructor discusses how to measure performance, benchmarking, well-known benchmarks, and ways to make software faster. Examples from real-world scenarios like Netflix and Grand Theft Auto are used to illustrate concepts such as row-major vs. column-major traversal, profiling, debugging performance problems, and continuous performance testing in DevOps.

Instructor

George Candea

George Candea heads the Dependable Systems Lab, where he develops techniques and abstractions for building efficient and trustworthy computer systems. His current work focuses on making performance and energy programmable, i.e., providing first-class abstractions to capture a system’s performance and energy behavior (as interfaces do for functionality) and to use them dependably to design, code, and operate efficient systems.In the recent past, George also served as CEO and later Chief Scientist of Cyberhav

Official source

Related concepts (32)

Continuous integration

In software engineering, continuous integration (CI) is the practice of merging all developers' working copies to a shared mainline several times a day. Nowadays it is typically implemented in such a way that it triggers an automated build with testing. Grady Booch first proposed the term CI in his 1991 method, although he did not advocate integrating several times a day. Extreme programming (XP) adopted the concept of CI and did advocate integrating more than once per day – perhaps as many as tens of times per day.

Quantifier (logic)

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier in the first order formula expresses that everything in the domain satisfies the property denoted by . On the other hand, the existential quantifier in the formula expresses that there exists something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula.

Continuous delivery

Continuous delivery (CD) is a software engineering approach in which teams produce software in short cycles, ensuring that the software can be reliably released at any time and, following a pipeline through a "production-like environment", without doing so manually. It aims at building, testing, and releasing software with greater speed and frequency. The approach helps reduce the cost, time, and risk of delivering changes by allowing for more incremental updates to applications in production.

Software testing

Software testing is the act of examining the artifacts and the behavior of the software under test by validation and verification. Software testing can also provide an objective, independent view of the software to allow the business to appreciate and understand the risks of software implementation. Test techniques include, but are not necessarily limited to: analyzing the product requirements for completeness and correctness in various contexts like industry perspective, business perspective, feasibility and viability of implementation, usability, performance, security, infrastructure considerations, etc.

Universal quantification

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", or "for any". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other words, it is the predication of a property or relation to every member of the domain. It asserts that a predicate within the scope of a universal quantifier is true of every value of a predicate variable.

Related lectures (64)

Software Performance

Explores software performance, covering metrics, latency, optimization techniques, and real-world examples like Grand Theft Auto.

Predicate Logic: Quantifiers, CNF, DNF

Covers Predicate Logic, focusing on Quantifiers, CNF, and DNF.

Debugging and Optimization

Covers types of errors in programming and emphasizes the importance of debugging and optimization techniques.

Speckles: Microscopic Analysis

Covers the microscopic analysis of speckles and their applications in research.

The Role of Symmetries