Distributed Systems

Catalog description

This course consists of the discussion of special problems related to distributed control such as election and mutual exclusion, routing, data management, Byzantine agreement, and deadlock handling. The student will get exposed to fundamental issues in distributed system design, recent development, and even research trends in this area, as well as the hands-on experience of using Java sockets to program and implement a distributed system. Prerequisites: Undergraduate coursework in programming languages, operation systems, computer architecture, and algorithm design. Permission of department required. Typically offered Fall Spring Summer. Course Learning Outcomes 1. Explain the hierarchical, layered structure of typical network architecture, as well as the different distributed computing paradigms. 2. Demonstrate mastery java socket programming for distributed system implementation. 3. Analyze critical issues in distributed computing, such as mutual exclusion, logical time, and fault tolerance. View Class Schedule