Parallel Computing

340 Pages·2012·5.29 MB·English

by  Eero Vainikko

University of Tartu Institute of Computer Science
Parallel Computing
MTAT.08.020
PARALLEELARVUTUSED
[email protected]
Liivi 2 - 324
2012/13 Fall term
2 Practical information about the course
Lectures:
Thursdays Liivi 2 - 612 16:15 – Eero Vainikko
Computer classes:
Mondays Liivi 2 - 205 at 16:15 – Oleg Batrašev <[email protected]>
• 6 EAP
• Exam
3 Practical information about the course
In theory, there is no difference between theory and practice.
But, in practice, there is.
Jan L. A. van de Snepscheut
4 Practical information about the course
NB!
To be allowed to the exam, all computer class exercises must be submitted, and
the deadlines should be met!
The final grade consists of:
1. Computer class exercises 50%
2. Oral exam with the blackboard 40%
3. Active participation at lectures 10%
Course homepage (http://www.ut.ee/~eero/PC/)
5 Course syllabus
Course content (preliminary, about to change on the way)
1. Motivation for parallel computing
2. Classifications of parallel systems
3. Clos-networks, Beowulf clusters, Grid, Peer-to-peer networks
4. Benchmarks
5. Speedup, efficiency
6. Amdahl’s law
7. Scaled efficiency, ways for increasing the efficiency
8. Fortran95, HPF
9. OpenMP
10. MPI
11. Assessment of parallel algorithms, definition of optimality
6 Course syllabus
12. Main techniques in parallel algorithms:
13. Balanced trees
14. Pointer jumping
15. Divide and conquer
16. Partitioning
17. Pipelining
18. Accelerated Cascading
19. Symmetry breaking
7 Course syllabus
Computer class activities:
1. Fortran 90/95
2. OpenMP
3. Message Passing Interface
4. Solving various parallelisation problems
Literature:
1. A.Grama, A.Gupta, G.Karypis and V.Kumar. “Introduction to Parallel Comput-
ing”, Second Edition, Addison-Wesley, 2003.
2. L. Ridgway Scott, Terry Clark and Babak Bagheri. “Scientific Parallel Comput-
ing”, Princeton University Press, 2005.
8 Course syllabus
3. Jack Dongarra, Ian Foster, Geoffrey Fox, William Gropp, Ken Kennedy, Linda
Torczon and Andy White. “Sourcebook of Parallel Computing”, Morgan Kauf-
mann Publishers, 2003.
4. I.Foster. "Designing and Building Parallel Programs", Reading, MA: Addison-
Wesley, 1995; http://www.mcs.anl.gov/dbpp.
5. Scott, L. Ridgway Clark, Terry Bagheri, Babak, “Scientific Parallel Computing”,
Princeton University Press, 2005.
6. E.Vainikko. "Fortran95 ja MPI", TÜ Kirjastus, 2004.
7. EdAkin,“Object-OrientedProgrammingviaFortran90/95”,CambridgeUniver-
sity Press, 2003.
8. A.C.Marshall,Fortran901DayCourse(http://www.liv.ac.uk/HPC/
F90Course1DayHomePage.html) ,[1997]
9. C.-K- Shene, “Fortran 90 Tutorial (http://www.cs.mtu.edu/~shene/
COURSES/cs201/NOTES/fortran.html)” Department of Computer
Science, Michigan Technological University, [2009.]
9 Course syllabus
10. P.S.Pacheco."ParallelProgrammingwithMPI",MorganKaufmannPubl,1997.
11. Joseph Ja’Ja’. "An Introduction to Parallel Algorithms", Addison-Wesley Publ.,
1992.
12. Ralf Steinmetz, Klaus Wehrle (Eds.), Peer-to-Peer Systems and Applications,
LNCS 3485, Springer, 2005.
10 Introduction
Why do we need parallel computing?
WFirrsitte, fdoormwngarosumpsanoyf 2re!asons as you can during 5 minutes!