Note: This is an archived Handbook entry from 2011.
|Dates & Locations:|| |
This subject is not offered in 2011.
|Time Commitment:||Contact Hours: 24 hours of lectures, 12 hours of tutorial/laboratory classes; Non-contact time commitment: 84 hours |
Total Time Commitment: Not available
The prerequisites are:
Study Period Commencement:
Not offered in 2011
|Recommended Background Knowledge:|| |
|Non Allowed Subjects:|| |
|Core Participation Requirements:||For the purposes of considering request for Reasonable Adjustments under the Disability Standards for Education (Cwth 2005), and Students Experiencing Academic Disadvantage Policy, academic requirements for this subject are articulated in the Subject Description, Subject Objectives, Generic Skills and Assessment Requirements of this entry. The University is dedicated to provide support to those with special requirements. Further details on the disability support scheme can be found at the Disability Liaison Unit website: http://www.services.unimelb.edu.au/disability/|
Dr Adrian Pearce
|Subject Overview:||Topics covered include: synchronous and asynchronous network algorithms that address resource allocation, communication, consensus among distributed processes, distributed data structures, data consistency, deadlock detection, leader election, and global snapshots issues in distributed systems.|
|Objectives:||On successful completion students should : |
|Assessment:||Assignments on devising, analysing, and applying algorithms to solve real world problems during semester (40%) and a 3-hour written examination (60%). All components must be completed satisfactorily to pass the subject.|
|Prescribed Texts:|| |
|Breadth Options:|| |
This subject is not available as a breadth subject.
|Fees Information:||Subject EFTSL, Level, Discipline & Census Date|
On completion of this subject students should:
Master of Engineering (Software) |
Download PDF version.