Distributed Algorithms, Fall 2001

Abstract:: Design and analysis of concurrent algorithms, emphasizing those suitable for use in distributed networks. Process synchronization, allocation of computational resources, distributed consensus, distributed graph algorithms, election of a leader in a network, distributed termination, deadlock detection, concurrency control, communication, and clock synchronization. Special consideration given to issues of efficiency and fault tolerance. Formal models and proof methods for distributed computation. Course Description 6.852J / 18.437J intends to: (1) provide a rigorous introduction to the most important research results in the area of distributed algorithms, and (2) prepare interested students to carry out independent research in distributed algorithms. Topics covered include: design and analysis of concurrent algorithms, emphasizing those suitable for use in distributed networks, process synchronization, allocation of computational resources, distributed consensus, distributed graph algorithms, election of a leader in a network, distributed termination, deadlock detection, concurrency control, communication, and clock synchronization. Special consideration is given to issues of efficiency and fault tolerance. Formal models and proof methods for distributed computation are also discussed.

Distributed Algorithms, Fall 2005

Abstract:: This course intends to provide a rigorous introduction to the most important research results in the area of distributed algorithms, and prepare interested students to carry out independent research in distributed algorithms. Topics covered include: design and analysis of concurrent algorithms, emphasizing those suitable for use in distributed networks, process synchronization, allocation of computational resources, distributed consensus, distributed graph algorithms, election of a leader in a network, distributed termination, deadlock detection, concurrency control, communication, and clock synchronization. Special consideration is given to issues of efficiency and fault tolerance. Formal models and proof methods for distributed computation are also discussed.

Abstract:: Normally taken by physics majors in their sophomore year. Einstein's postulates; consequences for simultaneity, time dilation, length contraction, clock synchronization; Lorentz transformation; relativistic effects and paradoxes; Minkowski diagrams; invariants and four-vectors; momentum, energy and mass; particle collisions. Relativity and electricity; Coulomb's law; magnetic fields. Brief introduction to Newtonian cosmology. Introduction to some concepts of General Relativity; principle of equivalence. The Schwarzchild metric; gravitational red shift, particle and light trajectories, geodesics, Shapiro delay.

Abstract:: Normally taken by physics majors in their sophomore year. Einstein's postulates; consequences for simultaneity, time dilation, length contraction, clock synchronization; Lorentz transformation; relativistic effects and paradoxes; Minkowski diagrams; invariants and four-vectors; momentum, energy and mass; particle collisions. Relativity and electricity; Coulomb's law; magnetic fields. Brief introduction to Newtonian cosmology. Introduction to some concepts of General Relativity; principle of equivalence. The Schwarzchild metric; gravitational red shift, particle and light trajectories, geodesics, Shapiro delay. This course, which concentrates on special relativity, is normally taken by physics majors in their sophomore year. Topics include Einstein's postulates, the Lorentz transformation, relativistic effects and paradoxes, and applications involving electromagnetism and particle physics. This course also provides a brief introduction to some concepts of general relativity, including the principle of equivalence, the Schwartzschild metric and black holes, and the FRW metric and cosmology.