Distributed Algorithms  
11 votes
Free
|
||
|
Distributed algorithms are algorithms designed to run on multiple processors, without tight centralized control. In general, they are harder to design and harder to understand than single-processor sequential algorithms. Distributed algorithms are used in many practical systems, ranging from large computer networks to multiprocessor shared-memory systems. They also have a rich theory, which forms the subject matter for this course. The core of the material will consist of basic distributed algorithms and impossibility results, as covered in Prof. Lynch's book Distributed Algorithms. This will be supplemented by some updated material on topics such as self-stabilization, wait-free computability, and failure detectors, and some new material on scalable shared-memory concurrent programming. Categories:
Computer Sciences
Starts :
2009-09-01 |
|
AlternativesIf you know any alternatives, please let us know. PrerequisitesIf you can suggest any prerequisite, please let us know. Certification Exams-- there are no exams to get certification after this course --If your company does certification for those who completed this course then register your company as certification vendor and add your exams to the Exams Directory. | ||
0
0Add to calendar
Let us know when you did the course Distributed Algorithms.
Add the course Distributed Algorithms to My Personal Education Path.
Select what exam to connect to the course. The course will be displayed on the exam page in the list of courses supported for certification with the exam.