|
Dec 02, 2024
|
|
|
|
CS 643 - Distributed Systems Units: 3 Distributed Systems theory and semantics. Topics may include: temporal logic, proof of program properties, time (logical clocks), state (distributed snapshots), fault-tolerance, replication, rollback recovery, processes and threads, Remote Procedure Calls, file systems. Programming projects and review of literature.
Prerequisites: CS 441 or CS 621. Credit Restrictions: Computer Science M.S. or B.S. students only. Equivalent Quarter Course: CS 6580. Possible Instructional Methods: Entirely On-ground. Grading: A-F grading only. Student Learning Outcomes - Upon successful completion of this course students will be able to: - Analyze the non-functional characteristics of distributed applications and differentiate between different types of middleware systems.
- Implement, design and deploy distributed systems using the prevalent models of web applications, remote objects, web services, and asynchronous messaging.
- Elaborate the function and interplay of network protocols from ARP to application protocols that enable distributed systems on the Internet.
- Develop the technical ability to code solutions with core networking protocols.
- Compare and explain the Network file system (NFS), the Andrew File System (AFS), and the Hadoop Distributed File System (HDFS) for Big data.
Add to Folder (opens a new window)
|
|