Note: This unit version has not been officially published yet and is subject to change!
COMP2121: Principles of Distributed Systems and Networks (2017 - Semester 2)
|Unit:||COMP2121: Principles of Distributed Systems and Networks (6 CP)|
|Faculty/School:||School of Information Technologies|
Dr Gramoli, Vincent
|Session options:||Semester 2|
|Versions for this Unit:|
|Pre-Requisites:||(INFO1103 OR INFO1903) AND (INFO1105 OR INFO1905).|
|Co-Requisites:||COMP2007 OR COMP2907.|
|Brief Handbook Description:||The unit will provide a broad introduction to the principles of distributed systems and their design; provide students the fundamental knowledge required to analyse and construct various types of distributed systems; explain the common architectural principles and approaches used in the design of networks at different scales (e.g. shared medium access and routing); introduce the programming skills required for developing distributed applications, and will cover the use of Java class libraries and APIs; cover common approaches and techniques in distributed resource management (e.g. task scheduling).|
|Assumed Knowledge:||Introductory Java programming unit, Data Structures, Algorithms|
|Additional Notes:||The unit will provide the introductory platform for students interested in more advanced units in the area of distributed systems and networks, such as ELEC3506 (Data Communications and the Internet), COMP5116 (Internet Protocols), COMP5416 (Advanced Network Technologies), and COMP5426 (Parallel and Distributed Computing).|
Dr Gramoli, Vincent
|T&L Activities:||The lectures will provide the theoretical and conceptual foundations of the material. The lab classes will present more specific examples of particular systems and network protocols in detail, with a focus on the programming aspects of the material.
The use of these complementary modes of delivery will enhance the students` learning experience, by reinforcing the concepts presented in the lectures with practical examples and realisation of solutions to conceptual problems, and by allowing the students to gain hands-on experience with implementing those solutions.
Attributes listed here represent the key course goals (see Course Map tab) designated for this unit. The list below describes how these attributes are developed through practice in the unit. See Learning Outcomes and Assessment tabs for details of how these attributes are assessed.
|Attribute Development Method||Attribute Developed|
|The tasks and assignments in the unit will provide ample opportunity for students to exercise design and problem solving skills, particularly in the programming tasks that will require development of original solutions. The issue of plagiarism will be addressed.||Design (Level 2)|
|The task and assignment give students opportunities to identify, integrate and synthesise knowledge on distributed systems and programming to solve problems under constraints.||Engineering/IT Specialisation (Level 2)|
|The students will be given various problems that they will need to solve, requiring research of the appropriate background information using resources such as the university library and the Internet. Students will also be required to understand different types of information and its representation and use in distributed systems, and will be exposed to standards that ensure the consistency and quality of such information.||Information Seeking (Level 2)|
|The students will be required to produce written assignments and reports and develop professional quality, well-documented software that can be understood and reused by other programmers.||Communication (Level 2)|
|The students will become familiar with the ethical issues pertaining to the use of large-scale distributed systems, and will understand the risks involved with the access to and processing of large quantities of information and the importance of its security and privacy.||Professional Conduct (Level 3)|
For explanation of attributes and levels see Engineering & IT Graduate Outcomes Table.
Learning outcomes are the key abilities and knowledge that will be assessed in this unit. They are listed according to the course goal supported by each. See Assessment Tab for details how each outcome is assessed.Design (Level 2)
The unit will use programming assignments, a mid-term and a final exam.
The mid-semester exam and final exam will test the students’ understanding of the theoretical material and concepts and ability to put it in the appropriate context of solving problems. The programming assignments will enable students to develop and test their practical skills and benchmark them against set criteria.
|Assessment Feedback:||Marks will be awarded for the assignments and mid-term exam and will reflect the students’ understanding of the assessed material and their ability to apply it in a programming task.
The tutor(s) will encourage interactive learning and provide an opportunity for students to test their understanding in a classroom setting.
The solutions of the assignments will be discussed in the tutorial/lab classes and provide an opportunity for the students to learn by comparing their solutions to the recommended ones.
|Policies & Procedures:||IMPORTANT: School policy relating to Academic Dishonesty and Plagiarism.
In assessing a piece of submitted work, the School of IT may reproduce it entirely, may provide a copy to another member of faculty, and/or to an external plagiarism checking service or in-house computer program and may also maintain a copy of the assignment for future checking purposes and/or allow an external service to do so.
See the policies page of the faculty website at http://sydney.edu.au/engineering/student-policies/ for information regarding university policies and local provisions and procedures within the Faculty of Engineering and Information Technologies.
Note: Students are expected to have a personal copy of all books listed.
Note: References are provided for guidance purposes only. Students are advised to consult these books in the university library. Purchase is not required.
Note that the "Weeks" referred to in this Schedule are those of the official university semester calendar https://web.timetable.usyd.edu.au/calendar.jsp
|Week 1||Lecture: Introduction to distributed systems. Goals of the UoS, definition and challenges.|
|Week 2||Lecture: Concurrency in operating systems. UNIX processes, context switches, Java threads.|
|Lab: Java multithreading.|
|Week 3||Lecture: Communication 1/2. Network layers, routing protocols, sockets.|
|Tutorial: Routing protocols.|
|Week 4||Lecture: Communication 2/2. TCP/IP, RPC-like mechanisms, Java RMI.|
|Lab: Java sockets and server implementation.|
|Week 5||Lecture: Naming. Name spaces, decription of DNS, comparison of distributed file systems.|
|Lab: Remote Method Invocation.|
|Assessment Due: Programming Assignment 1|
|Week 6||Lecture: Synchronization 1/3. Notions of physical time and logical times, network time protocol, logical and vector clocks, leader election.|
|Tutorial: Network Time Protocol.|
|Week 7||Lecture: Synchronization 2/3. Leader election. Multicast. Mutual exclusion.|
|Assessment Due: Mid-Sem Exam|
|Week 8||Lecture: Consistency. The notion of consistency among entities of a distributed system. Sequential and causal consistencies, database transactions, coherence.|
|Distributed execution and consistency.|
|Week 9||Lecture: Synchronization 2/3. Chip-multiprocessor synchronization. Using mutual exclusion, the problems of deadlock and starvation, and transactional memory.|
|Lab: Java transactional memory.|
|Week 10||Lecture: Failures. Crash and Byzantine (malicious) failures. Presentation of the fundamental problem of consensus. Description of the two-phase commit (2PC) protocol.|
|Tutorial: Storage algorithms.|
|Week 11||Lecture: Dynamism. Epidemic and gossip-based protocols and probabilistic guarantees. Dynamic storage systems tolerating unbounded failures.|
|Lab: Gossip-based protocols.|
|Assessment Due: Programming Assignment 2|
|Week 12||Lecture: Security. Mechanisms to tolerate malicious attacks. Private and public key cryptography. Secured communication channels.|
|Week 13||Lecture: Summary and review|
|Exam Period||Assessment Due: Final Exam|
The following is a list of courses which have added this Unit to their structure.
This unit contributes to the achievement of the following course goals:
|Design (Level 2)||Yes||32.5%|
|Engineering/IT Specialisation (Level 2)||Yes||47.5%|
|Information Seeking (Level 2)||Yes||12%|
|Communication (Level 2)||Yes||3%|
|Professional Conduct (Level 3)||Yes||5%|
These goals are selected from Engineering & IT Graduate Outcomes Table which defines overall goals for courses where this unit is primarily offered. See Engineering & IT Graduate Outcomes Table for details of the attributes and levels to be developed in the course as a whole. Percentage figures alongside each course goal provide a rough indication of their relative weighting in assessment for this unit. Note that not all goals are necessarily part of assessment. Some may be more about practice activity. See Learning outcomes for details of what is assessed in relation to each goal and Assessment for details of how the outcome is assessed. See Attributes for details of practice provided for each goal.