Efficient implementation of algorithms

Lecturer:

Ivan Šimeček (gar.)

Tutor:

Ivan Šimeček (gar.)

Supervisor:

Department of Computer Science

Synopsis:

Student learn to combine their SW skills (efficient algorithms) and HW knowledge (utilization of all available features of the particular processor and memory architecture). Students learn the basics of code tuning.

Requirements:

Subject BI-EFA. Knowledge of C or C++ programming language, passive knowledge of assembly language. Good knowledge of processor and memory architecture concepts.

Syllabus of lectures:

1. Recap of basic computer architecture concepts (pipeline, vector instructions, cache memory, TLB).

2. New architecture features of modern CPUs.

3. Multicore architectures.

4. Multicore programming in OpenMP API.

5. Efficient algorithms, asymptotic complexity.

6. Efficient data structures and their combinations.

7. Basic routines for numerical linear algebra (dense matrices).

8. Basic routines for numerical linear algebra (sparse matrices).

9. Source code transformations I.

10. Source code transformations II.

11. Compilers and optimizations.

12. Models of cache behavior.

13. Models of cache behavior in multicore environments.

Syllabus of tutorials:

1. Introduction, laboratory equipment

2. Performance metrics.

3. Algorithms for searching elements.

4. Algorithms for searching patterns in text, evaluation of logical expressions

5. Event counters based profiling, assignment No. 1.

6. Experiments with compiler's settings

7. Sorting of arrays and linked lists.

8. Sorting on external memories, checking the assignment No. 1

9. FFT algorithm, modelling of multi-element interaction, assignment No. 2

10. Graph algorithms, assignment No. 3.

11. Encryption, data compression, checking the assignment No. 2

12. Available math libraries.

13. Checking the assignment No. 3.

Study Objective:

Our students have good knowledge of two main aspects of Computer Science: SW and HW. However, these fields are often taught separately. This course aims to link together the knowledge of both of these fields, resulting in the ability to write efficient code for a particular hardware. Students will learn how to predict the maximum code performance and how to achieve it.

Study materials:

Wolfe, M. ''High-Performance Compilers for Parallel Computing''. Addison Wesley, 1995. ISBN 0805327304.

Wadleigh, K. R., Crawford, I. L. ''Software Optimization for High Performance Computing: Creating Faster Applications''. Prentice Hall PTR, 2000. ISBN 0130170089.

Note:

Time-table for winter semester 2011/2012:

	06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon	roomT9:301 Šimeček I. 11:00–12:30 (lecture parallel1) Dejvice NBFIT učebnaroomT9:350 Šimeček I. 12:45–14:15 ODD WEEK (lecture parallel1 parallel nr.101) Dejvice NBFIT PC ucebna
Tue
Fri
Thu
Fri

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans:

• Computer Science, Version for Students who Enrolled in 2009 and 2010, Presented in Czech (compulsory course of the specialization)
• Information Systems and Management, Version for Students who Enrolled in 2009 and 2010, in Czech (VO)
• Informatics, Version for Students who Enrolled in 2009 and 2010, Presented in Czech (VO)
• Informatics (Bachelor)- Version for those who Enrolled in 2011 and 2012 (in Czech) (VO)
• Information Systems and Management - Version for those who Enrolled in 2011 and 2012 (in Czech) (VO)
• Computer Science - Version for those who Enrolled in 2011 and 2012 (in Czech) (compulsory course of the specialization)