Distributed Algorithms (PDF)

Simple item page
dc.contributor.authorLynch, Prof. Nancy
dc.date.accessioned2014-09-22T17:44:04Z
dc.date.available2014-09-22T17:44:04Z
dc.date.issued2006
dc.descriptionDistributed 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.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/407
dc.titleDistributed Algorithms (PDF)en_US

Files

Original bundle

Now showing 1 - 5 of 23
Thumbnail Image
Name:
Lecture (1).pdf
Size:
112.51 KB
Format:
Adobe Portable Document Format
Description:
Download
Thumbnail Image
Name:
Lecture (2).pdf
Size:
224.05 KB
Format:
Adobe Portable Document Format
Description:
Download
Thumbnail Image
Name:
Lecture (3).pdf
Size:
247.89 KB
Format:
Adobe Portable Document Format
Description:
Download
Thumbnail Image
Name:
Lecture (4).pdf
Size:
160.96 KB
Format:
Adobe Portable Document Format
Description:
Download
Thumbnail Image
Name:
Lecture (5).pdf
Size:
172.97 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electrical Engineering