Course description

Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles Instructions

A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.

NIE-DSV Distributed Systems and Computing Extent of teaching: 2P+1C

Instructor: Janeček J., Tvrdík P. Completion: Z,ZK

Department: 18104 Credits: 5 Semester: Z

Annotation:
Students are introduced to methods for coordination of processes in distributed environment characterised by nondeterministic time responses of computing processes and communication channels. They learn basic algorithms that assure correctness of computations realized by a group of loosely coupled processes and mechanisms that support high availability of both data and services, and safety in case of failures.

Lecture syllabus:

1. Distributed applications, communication methods

2. Procedural communication - XML-RPC, CORBA, Java RMI, SOAP/RESTful

3. Model of distributed computation, simple examples

4. Snapshots of distributed computation, logic time

5. Wave algorithm, algorithm symmetry - server selection

6. Exclusive access algorithms

7. Deadlock prediction and detection - on resource sharing and communication

8. Termination of distributed application, quoras

9. Data sharing and replication, distributed databases

10. P2P systems and DHT technologies

11. Agent applications, mobility of computation

12. Architecture of clouds technologies, computation methods

Seminar syllabus:

1. Practices introduction

2. Java RMI

3. XML-RPC

4. SOAP

5. CORBA

6. Semestral project presentation

Literature:

1. Dollimore, J. - Kindberg, T. - Coulouris, G. : Distributed Systems: Concepts and Design (5th Edition). Pearson, 2011. ISBN 0132143011.

2. Tanenbaum, A. S. - van Steen, M. : Distributed Systems: Principles and Paradigms (2nd Edition). Create Space Independent Publishing Platform, 2016. ISBN 153028175X.

3. Lynch, N. A. : Distributed Algorithms. Elsevier, 2009. ISBN 8181479645.

4. Tel, G. : Introduction to Distributed Algorithms. Cambridge University Press, 2001. ISBN 0521794838.

5. Wan Fokkink : Distributed Algorithms: An Intuitive Approach (2nd Edition). MIT Press, 2018. ISBN 0262037661.

Requirements:
Basic knowledge in the area of operating systems, computer networks and communication.

Informace o předmětu a výukové materiály naleznete na https://moodle-vyuka.cvut.cz/course/view.php?id=2233

The course is also part of the following Study plans:

Study Plan Study Branch/Specialization Role Recommended semester

NIE-PB.21 Computer Security 2021 V 3

NIE-SI.21 Software Engineering 2021 V 3

NIE-NPVS.21 Design and Programming of Embedded Systems 2021 V 3

NIE-TI.21 Computer Science 2021 VO 3

NIE-PSS.21 Computer Systems and Networks 2021 PS 3

Page updated 18. 4. 2024, semester: L/2020-1, L/2023-4, L/2019-20, Z/2021-2, L/2022-3, Z/2023-4, Z/2019-20, Z/2022-3, L/2021-2, Z/2024-5, Z/2020-1, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška

NIE-DSV	Distributed Systems and Computing			Extent of teaching:	2P+1C
Instructor:	Janeček J., Tvrdík P.			Completion:	Z,ZK
Department:	18104	Credits:	5	Semester:	Z

1.		Distributed applications, communication methods
2.		Procedural communication - XML-RPC, CORBA, Java RMI, SOAP/RESTful
3.		Model of distributed computation, simple examples
4.		Snapshots of distributed computation, logic time
5.		Wave algorithm, algorithm symmetry - server selection
6.		Exclusive access algorithms
7.		Deadlock prediction and detection - on resource sharing and communication
8.		Termination of distributed application, quoras
9.		Data sharing and replication, distributed databases
10.		P2P systems and DHT technologies
11.		Agent applications, mobility of computation
12.		Architecture of clouds technologies, computation methods

1.		Practices introduction
2.		Java RMI
3.		XML-RPC
4.		SOAP
5.		CORBA
6.		Semestral project presentation

1.		Dollimore, J. - Kindberg, T. - Coulouris, G. : Distributed Systems: Concepts and Design (5th Edition). Pearson, 2011. ISBN 0132143011.
2.		Tanenbaum, A. S. - van Steen, M. : Distributed Systems: Principles and Paradigms (2nd Edition). Create Space Independent Publishing Platform, 2016. ISBN 153028175X.
3.		Lynch, N. A. : Distributed Algorithms. Elsevier, 2009. ISBN 8181479645.
4.		Tel, G. : Introduction to Distributed Algorithms. Cambridge University Press, 2001. ISBN 0521794838.
5.		Wan Fokkink : Distributed Algorithms: An Intuitive Approach (2nd Edition). MIT Press, 2018. ISBN 0262037661.