![]() ![]() ![]() ![]() What do distributed algorithms researchers do? They (we) define various kinds of distributed computing environments, including shared-memory and network-based environments, and identify problems to be solved in those environments. They also appear in general theoretical computer science conferences such as FOCS (Foundations Of Computer Science) and STOC (Symposium on Theory Of Computing), and in broad conferences involving distributed computing, such as ICDCS (International Conference on Distributed Computing Systems). Theoretical results about distributed algorithms appear in research conferences such as PODC (Principles Of Distributed Computing), DISC (International Symposium on DIStributed Computing), OPODIS (International Conference On Principles Of DIStributed Systems), and SPAA (ACM Symposium on Parallelism in Algorithms and Architectures). They also have a rich theory, which forms the subject matter for this course. Distributed algorithms are used in many practical systems, ranging from large computer networks to multiprocessor shared-memory systems. In general, they are harder to design and harder to understand than single-processor sequential algorithms. Lectures: 2 sessions / week, 1.5 hours / session DescriptionÄistributed algorithms are algorithms designed to run on multiple processors, without tight centralized control. ![]()
0 Comments
Leave a Reply. |