Module Code
CSC3021
Concurrent Programming Abstraction and Java Threads, the Mutual Exclusion Problem, Semaphores, Models of Concurrency, Deadlock, Safety and Liveness Properties. Notions are exemplified through a selection of concurrent objects such as Linked Lists, Queues and Hash Maps. Principles of graph analytics, experimental performance evaluation, application of concurrent programming to graph analytics.
To understand the problems that are specific to concurrent programs and the means by which such problems can be avoided or overcome.
To model and to reason rigorously about the properties of concurrent programs; to analyse and construct concurrent programs in Java; to quantitatively analyse the performance of concurrent programs.
None
Coursework
100%
Examination
0%
Practical
0%
20
CSC3021
Autumn Semester
12 Weeks