IA039 Supercomputer Architecture and Intensive Computations

Faculty of Informatics
Spring 2004
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Teacher(s)
prof. RNDr. Luděk Matyska, CSc. (lecturer)
doc. RNDr. Radka Svobodová, Ph.D. (lecturer)
doc. RNDr. Eva Hladká, Ph.D. (alternate examiner)
RNDr. Lukáš Hejtmánek, Ph.D. (assistant)
Guaranteed by
prof. RNDr. Luděk Matyska, CSc.
Department of Machine Learning and Data Processing – Faculty of Informatics
Contact Person: prof. RNDr. Luděk Matyska, CSc.
Timetable
Tue 16:00–17:50 D3
Prerequisites
! I039 Supercomputer Architecture and Intensive Computations
At least elementary knowledge of programming languages FORTRAN, C and eventually C++ is expected.
Course Enrolment Limitations
The course is only offered to the students of the study fields the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives
Main goal of this lecture is to provide information about supercomputing architectures and basic programming methods for vector and parallel computers. First part focuses to the hardware, during the second part general optimization methods and programming methodology for parallel computer is discussed. The last part of the lecture is aimed to distributed systems.
Syllabus
  • High performance vector and superscalar processors.
  • Uniprocesor computers, computers with small number of processors, massively parallel computers; distributed systems.
  • Performance measurements, LINPACK test, TOP 500 list.
  • High performance uniprocessor systems, programming languages, methodology of efficient program writting, basis optimization methods for vector and superscalar computers.
  • Distributed systems, data and task decomposition, coarse grain parallelism, programming systems (PVM, LINDA, ...). Multiprocessor systems with shared memory, programming languages, decompozition of algorithms, basis optimization methods for small number of processors.
  • Massively parallel systems, parallel algorithms, fine grain parallelism.
  • Shared, distributed, and distributed shared memory; other alternatives. Sdílená, distribuovaná a distribuovaná sdílená paměť.
  • Scalability of computers and tasks.
Literature
  • PROTIC, Jelica, Milo TOMASEVIC and Veljko MILUTINOVIC. Distributed shared memory. Los Alamitos: IEEE Computer Society, 1998. x, 365 s. ISBN 0-8186-7737-6. info
  • FOSDICK, Lloyd D. An introduction to high-performance scientific computing. Cambridge: MIT Press, 1996. ix, 760. ISBN 0262061813. info
  • WOLFE, Michael Joseph. High performance compilers for parallel computing. Redwood City: Addison-Wesley Publishing Company, 1996. xiii, 570. ISBN 0-8053-2730-4. info
  • WILSON, Greg. Practical parallel programming. Cambridge: MIT Press, 1995. viii, 564. ISBN 0262231867. info
  • DOWD, Kevin. High performance computing. Sebastopol: O'Reilly & Associates, 1993. xxv, 371 s. ISBN 1-56592-032-5. info
Assessment methods (in Czech)
Klasická přednáška. V případě malého počtu zapsaných studentů (do 15) bude předmět veden formou semináře, tj. včetně samostatné průpběžné práce student; (příprava krátké přednášky). Předmět bude v takovém případě zakončen ústní zkouškou. V případě většího počtu zapsaných studentů nebudou v průběhu semestru žádná cvičení nebo domácí práce a předmět bude zakončen písemnou zkouškou (cca 10 příkladů za 100--150 bodů).
Language of instruction
Czech
Further Comments
The course is taught once in two years.
Teacher's information
http://www.ics.muni.cz/people/matyska/vyuka/hpc/hpc.html
The course is also listed under the following terms Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013.
  • Enrolment Statistics (Spring 2004, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2004/IA039