456-0103/01 – Distributed algorithms (DIA)

Gurantor departmentDepartment of Computer ScienceCredits4
Subject guarantorTomáš LavičkaSubject version guarantorTomáš Lavička
Study levelundergraduate or graduateRequirementChoice-compulsory
YearSemesterwinter
Study languageCzech
Year of introduction1997/1998Year of cancellation2002/2003
Intended for the facultiesFEIIntended for study typesMaster
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 2+2

Subject aims expressed by acquired skills and competences

Teaching methods

Summary

This study is based on orientation in algorithms, used in distributed systems with discussion about using and advantages presented methods. Student will learn about principles of distributed systems and about solution of events and collisions in these systems.

Compulsory literature:

Recommended literature:

Way of continuous check of knowledge in the course of semester

E-learning

Other requirements

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Přednášky: Distribuované systémy - co je distribuovaný systém, architektura a jazyky, distribuované algoritmy. Model - transition systems, algoritmy, následnost eventů, logické hodiny. Komunikační protokoly - Balanced Sliding-Window protokol, Timer-based protokol. Směrovací algoritmy - směrování, problém nejkratší cesty, směrovací tabulky, hierarchické směrování. Přepojování paketů - deadlock, strukturovaná a nestrukturovaná řešení. Wave a Travesal algoritmy - definice a přiklady Wave algoritmů, Traversal algoritmy. Volební algoritmy - kruhové sítě, arbitrary sítě, Korach-Kutten-Moranův algoritmus. Detekce ukončení - výpočet stromů a lesů, Wave řešení, další možná řešení. Neznačené sítě - deterministické algoritmy, algoritmus pravděpodobné volby, výpočet velikosti sítě. Snapshots - snapshot algoritmus, detekce zablokování. Synchronizace v síti - volby v synchonní síti, synchronizační algoritmus. Tolerance selhání v distribuovaných systémech - význam použití, robustní algoritmy, stabilizační algoritmy. Tolerance selhání v asynchronních systémech - Initially-dead procesy, deterministicky dosáhnutelné případy, slabé ukončení. Tolerance selhání v synchronních systémech - synchronní rozhodnutelné protokoly, autentizační protokoly, časová synchronizace. Stabilizace - grafové algoritmy, metodologie stabilizace.

Conditions for subject completion

Full-time form (validity from: 1960/1961 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of pointsMax. počet pokusů
Exercises evaluation and Examination Credit and Examination 100 (145) 51 3
        Examination Examination 100  0 3
        Exercises evaluation Credit 45  0 3
Mandatory attendence participation:

Show history

Conditions for subject completion and attendance at the exercises within ISP:

Show history

Occurrence in study plans

Academic yearProgrammeBranch/spec.Spec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2002/2003 (M2612) Electrical Engineering and Computer Science (2601T004) Measurement and Control Engineering P Czech Ostrava Choice-compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (2612T018) Electronics and Communication Technology P Czech Ostrava Choice-compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (10) Elektrické stroje a přístroje P Czech Ostrava Choice-compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (20) Elektrické pohony a výkonová elektronika P Czech Ostrava Choice-compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (3902T023) Computer Science P Czech Ostrava Choice-compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (3907T001) Electrical Power Engineering P Czech Ostrava Choice-compulsory study plan
2002/2003 (M2612) Electrical Engineering and Computer Science (3902T023) Computer Science P Czech Ostrava 5 Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2601T004) Measurement and Control Engineering P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2612T018) Electronics and Communication Technology P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (10) Elektrické stroje a přístroje P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (2642T004) Electrical Machines, Apparatus and Drives (20) Elektrické pohony a výkonová elektronika P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (3902T023) Computer Science P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (3907T001) Electrical Power Engineering P Czech Ostrava Choice-compulsory study plan
2001/2002 (M2612) Electrical Engineering and Computer Science (3902T023) Computer Science P Czech Ostrava 5 Choice-compulsory study plan
2000/2001 (M2612) Electrical Engineering and Computer Science (3902T023) Computer Science P Czech Ostrava 5 Choice-compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner

Assessment of instruction

Předmět neobsahuje žádné hodnocení.