Just how to Write Fast Code

Fundamental Information

The quick development and increasing complexity of computing platforms pose a significant challenge for designers of powerful computer software for engineering, technology, and customer applications: it becomes increasingly harder to harness the available computing energy. Simple implementations may lose up to a couple of sales of magnitude in performance. Having said that, creating implementations that are optimal the designer to own a knowledge of algorithms, abilities and limits of compilers, while the target platform’s architecture and microarchitecture. This course that is interdisciplinary the pupil into the foundations and advanced approaches to high end pc pc software development making use of essential functionality such as linear custom writing algebra kernels, transforms, filters, yet others as examples. The program will show you how exactly to optimize when it comes to memory hierarchy, benefit from unique instruction sets, and just how to publish code that is multithreaded multicore platforms, predicated on advanced research. Further, a basic technique for performance analysis and optimization is introduced that the pupils will use in group tasks that accompany this course. Finally, the program will introduce the pupils towards the current industry of automated performance tuning.

This course will build upon but expand the version taught in Spring 2005.

Topics Covered

• Algorithm analysis: Problem versus algorithm, cost and complexity(asymptotic, exact, calculated), O-calculus, algorithms in posting
• Computer architecture (an application viewpoint): architecture and microarchitecture, memory hierarchy, unique instruction sets, multicore platforms
• Compilers: talents, limits, just how to utilize
• Efficiency optimization: help guide to benchmarking, finding hotspots, rule analysis, performance optimization methods (for memory hierarchy, making use of vector directions, composing multithreaded rule); these practices are examined utilizing the examples when you look at the bullet that is next
• Numerical functionality examined in more detail (complexity, algorithms, how exactly to compose performance code that is highest): linear algebra kernels, transforms, filters, sparse linear algebra, sorting, other people, pursuit task
• State-of-the-art research in Automatic Efficiency Tuning: ATLAS, LAPACK, BeBOP, FFTW, SPIRAL, other people

Goals for this Course

• Learn a guideline just how to compose quick code that is numerical put it on in homeworks as well as your scientific study
• Understand the text between algorithms, implementations, and computer architecture
• Discover some fundamental algorithms that are numerical
• Discover ways to evaluate algorithms that are numerical

There’s absolutely no textbook because of this course. A number of the materials follows this guide.

The component this is certainly foundation (algorithms, computer architecture etc.) is likely to be compiled from a few books that are standard. The core component, which analyzes cutting advantage implementations for numerical issues is put together from research documents, the teacher’s own experience.