Leader: Michael Smith

Offered

Caulfield Second semester 2008 (Day)

Synopsis

Concurrent programming primitives and concepts. Application of concurrent techniques in distributed application designs. Design and implementation issues and techniques of distributed applications. Enabling techniques. Distributed patterns. Service discovery and lookup, leases and transactions of resources. Distributed events. Case studies of distributed programming paradigms and their applications (eg, JINI, JavaSpaces).

Objectives

Concurrent programming primitives and concepts. Application of concurrent techniques in distributed application designs. Design and implementation issues and techniques of distributed applications. Enabling techniques. Distributed patterns. Service discovery and lookup, leases and transactions of resources. Distributed events. Case studies of distributed programming paradigms and their applications (eg, JINI, JavaSpaces).

Assessment

Assignments: 50%; Examination: 50%

Contact hours

4 x contact hrs/week

Prerequisites

Admission to the Master of Network Computing or equivalent Masters level programs of the Faculty of Information Technology, previous knowledge of Java programming is desired, students without appropriate programming skills are expected to engage in extra private studies

Prohibitions

Completion of similar content in previous tertiary studies