Software Performance Fall 2014This is a course in the Masters program of the Faculty of Informatics at the University of Lugano. This page provides public access to the course material – lecture slides, videos, assignments.
Combine Systems, Tools, Theory
We connect material from Systems area courses (such as PL, OS, and HW) with Tools and Theory related to performance measurement and experimentation.
Navigate Across System Layers
Performance is a property that is best studied from a holistic perspective. For example, memory performance straddles garbage collector, virtual memory subsystem, and cache.
Become an Experimenter
We look at systems as objects of study and explore the factors affecting their performance. We consider workloads, measurement contexts, performance metrics, and data analysis.
Teaching Style How you get most out of this course
Why should you take this class?
This class prepares you to engineer efficient software systems, to detect performance problems and improve the performance of existing systems, and to identify possible new research problems.
How do you learn this?
You learn by trying, finding your own insights. This means the assignments can take a variable amount of time! We want you to formulate your own variations of problems and solve them.
How is the course structured?
- Readings and videos to prepare before class
- Interactive lectures
- Practical assignments after class
- Course: Midterm and Final exams
- Lab: Project
Logistics When, where, what and how
|Lectures||Wednesdays, 8:30 - 10:15 and Fridays, 8:30 - 10:15 in SI-007|
|Labs||Fridays, 13:30 - 15:15 in SI-007|
|Prerequisites||Java programming language experience|
|Textbook||David Lilja, Measuring Computer Performance, Cambridge University Press|
|Further Resources||Check our References page.|
|Midterm Exam||Friday, October 31|
|Final Exam||Tuesday, January 13, 2015, 09.30-12.30|
|SP Course Grade||Homework: 40%, Midterm: 25%, Final: 35%|
|SP Lab Grade||Homework: 30%, Project: 70%|
Team Instructor and teaching assistants
We are a professor and two PhD students who are members of the Faculty of Informatics. Besides teaching this course, we spend our days (and sometimes nights) on research in the areas of programming languages, systems, and software engineering.
Schedule A one-semester, 14-week course
We have three weekly lecture slots, two for the course (white), and one for the lab (blue). Here is the tentative schedule. We will update it as we progress through the course.
|Date||Topic||Preparation||In-Class Activities||Assignment out||Assignment due|
|Wed, Sep. 17||Introduction||Refresh your Java, C, and Intel Assembly language knowledge||Introduction, Informa Session. Lecture 1 Slides.||A01. Java & C|
|Fri, Sep. 19||PL Program Representation||Watch videos on program representation
(~45 minutes of videos, plus some breaks):
|Lecture 2 Slides.||A02. Simple Bytecode Metrics||A01. Java & C|
|Fri, Sep. 19||Building the Jikes RVM||Read the Care and Feeding section of the Jikes RVM User's Guide||Install and build the Jikes RVM||L01. Getting Started with the Jikes RVM|
|Wed, Sep. 24||PL Control-Flow Graph||Control-flow graphs and dot. Lecture 3 Slides.||A03. Control-Flow Graphs with ASM||A02. Simple Bytecode Metrics|
|Fri, Sep. 26||PL Loops||Finding loops. Lecture 4 Slides.||A04. Dominator Analysis||A03. Control-Flow Graphs with ASM|
|Fri, Sep. 26||Jikes RVM, AOS. Lab 2 Slides.
||L02. Jikes RVM Performance
||L01. Getting Started with the Jikes RVM
|Wed, Oct. 1||PL Compiler Optimization||Compiler optimization. Lecture 5 Slides.||A05. Add Exception Edges to Control-Flow Graph||A04. Dominator Analysis|
|Fri, Oct. 3||PL Program Analysis, PL Exceptions||Program analysis. Lecture 6 Slides. Exception handling.||-||-|
|Fri, Oct. 3||Getting Comfortable with the Jikes RVM||Watch introductory videos on Jikes RDB
(~40 minutes of videos, plus some breaks):
|Jikes RVM in Eclipse, Lab 3 Slides.||L03. Look and Tickle||L02. Jikes RVM Performance|
|Wed, Oct. 8||PL Class Hierarchy, PL Call Graph||Pacman project, Lecture 7 Slides.||A06. Call Graph with ASM||A05. Add Exception Edges to Control-Flow Graph|
|Fri, Oct. 10||PL Method Call Optimization||Read Fast Static Analysis of C++ Virtual Function Calls by Bacon and Sweeney (Section 1 of and most of Section 2) and Optimization of Object-Oriented Programs using Static Class Hierarchy Analysis (CHA) by Dean, Grove, and Chambers (Section 1 and the first part of Section 2)||Lecture 8 Slides.|
|Fri, Oct. 10||L04. Project kick-off||L03. Look and Tickle|
|Wed, Oct. 15||Ten Year Anniversary week; Special class|
|Fri, Oct. 17||Ten Year Anniversary week; Special class|
|Fri, Oct. 17||Ten Year Anniversary week; Special class|
|Wed, Oct. 22||-||-||-||A06. Call Graph with ASM|
|Fri, Oct. 24||PL Program Representation||-||gcc intermediate representation|
|Fri, Oct. 24|
|Wed, Oct. 29||study for midterm exam||review session|
|Fri, Oct. 31||Study for midterm exam||Midterm exam|
|Fri, Oct. 31||L04. Project kick-off|
|Wed, Nov. 5||PL Memory Management, Part 1||Read An Introduction to Garbage Collection: Part I - The Real Costs of C++ Memory Management||Stack, heap, globals, explicit memory management, reference counting. Lecture 9 Slides.||A07. Memory Management|
|Fri, Nov. 7||PL Memory Management, Part 2||Read An Introduction to Garbage Collection: Part II - A Look Under the Hood||Heap analysis, NEW, tracing GC. Lecture 10 Slides.||A07. Memory Management|
|Fri, Nov. 7|
|Wed, Nov. 12||PL Memory Management, Part 3||Memory Leaks. Leak Detection. References. Lecture 11 Slides. Paper: Low-Overhead Memory Leak Detection Using Adaptive Statistical Profiling|
|Fri, Nov. 14||HW Cache||Memory hierarchy. Access latency. Direct-mapped vs. set-associative vs. fully-associative caches. Lecture 12 Slides.||A08. Cache Simulator|
|Fri, Nov. 14|
|Wed, Nov. 19||OS Dynamic Linking||Read The Inside Story on Shared Libraries and Dynamic Loading and Optional Program Library HOWTO (Linux article but the concepts are the same)||Shared libraries, dlopen/dlsym, library interposition, tracing dynamic linker activity. Lecture 13 Slides.||A08. Cache Simulator|
|Fri, Nov. 21||Tools PL DTrace||Read Dynamic Instrumentation of Production Systems (all 14 pages)||DTrace. Lecture 14 Slides.||A09. Dynamic Instrumentation with DTrace|
|Fri, Nov. 21||Project Milestone 1|
|Wed, Nov. 26||OS HW Virtual Memory||Virtual memory management. From malloc to mmap. Lecture 15 Slides.||A09. Dynamic Instrumentation with DTrace|
|Fri, Nov. 28||PL Dynamic Class Loading||Read Dynamic Class Loading in the Java Virtual Machine (everything except Section 4 "Maintaining Type-safe Linkage")||Lazy loading, type-safe linking, multiple namespaces, class unloading, user-defined class loaders (SP-Compiler Eclipse project). Lecture 16 Slides.||A10. Practice with Dynamic Class Loading in the JVM|
|Fri, Nov. 28|
|Wed, Dec. 3||PL Dynamic Binary Instrumentation||Java instrumentation agent. ASM class rewriting (sp-2014-dbi Eclipse project). Lecture 17 Slides.||A11. Dynamic Binary Instrumentation||A10. Practice with Dynamic Class Loading in the JVM|
|Fri, Dec. 5||Tools PL R||Optionally read Evaluating the design of the R language||Variables, functions, vectors, factors, lists, data frames. Lecture 18 Slides.|
|Fri, Dec. 5||Demo||Project Milestone 2|
|Wed, Dec. 10||A11. Dynamic Binary Instrumentation|
|Fri, Dec. 12||Tools Theory Descriptive Statistics & Visualization||Read Chapters 1 "Introduction", 2 "Metrics of performance", and 3 "Average performance and variability" of the textbook||Central tendency & dispersion, PDF, CDF, jitter plot, box plot, histogram, ECDF, quantile/quantile plot. Lecture 19 Slides.||A12. Array Size Analysis|
|Fri, Dec. 12|
|Wed, Dec. 17||Tools PL ggplot2||Read the ggplot2 Quick Reference||Grammar of Graphics, ggplot2. Lecture 20 Slides.|
|Fri, Dec. 19||Tools Theory Random Error||Read Chapter 4 "Errors in experimental measurements" of the textbook||Accuracy and random error vs. precision and systematic error, confidence intervals. Lecture 22 Slides.||A12. Array Size Analysis|
|Fri, Dec. 19||Project presentation|
Homework consists of both written and programming assignments. You are encouraged to collaborate on the assignments. We recommend that you work in groups of two. However, you must produce the complete final writing and implementation on your own, and you must fully understand the solution you submit. Moreover, in your submission you must acknowledge all your collaborators.
In general, no late assignments are accepted.
The handouts of each assignment includes specific submission instructions. Please follow the submission instructions exactly as written!
Where are the assignments?
All assignments are posted on the schedule.