Third-Cycle Courses

Faculty of Engineering | Lund University

Details for the Course Syllabus for Course EDA015F valid from Autumn 2013

Printable view

  • The goal of the course is to give knowledge about advanced mechanisms, design principles, and libraries for concurrent programming, for application in interactive and parallel systems.
  • The course topics include: thread safety, shared objects, robust utilization of parallelism, responsiveness in interactive systems, liveness, performance, testing, explicit locks, atomic variables, non-blocking algorithms, and custom synchronization.
Knowledge and Understanding
  • For a passing grade the doctoral student must
  • have knowledge about mechanisms and libraries for concurrent programming in Java.

    understand the design principles for concurrent programming in Java.
Competences and Skills
  • For a passing grade the doctoral student must
  • be able to design, implement and test concurrent Java programs.
Judgement and Approach
  • For a passing grade the doctoral student must
  • demonstrate the ability to critically evaluate and compare concurrency mechanisms and libraries for different quality characteristics.
Types of Instruction
  • Seminars
  • Exercises
Examination Formats
  • Written assignments
  • Seminars given by participants
  • The students will present parts of the material to their peers, create new exercises to illustrate mechanisms and design principles, and actively participate at the seminars.
  • Failed, pass
Admission Requirements
Assumed Prior Knowledge
  • Proficiency in sequential object-oriented programming. Basic knowledge on concurrent programming (e.g., from the course EDA040).
Selection Criteria
  • Goetz, B.: Java Concurrency in Practice. Addison-Wesley, 2006. ISBN 0321349601.
  • In addition, articles will be used.
Further Information
Course code
  • EDA015F
Administrative Information
  •  -10-08
  • FN1/Anders Gustafsson

All Published Course Occasions for the Course Syllabus

1 course occasion.

Start Date End Date Published
2013‑10‑08 (approximate) 2013‑12‑20

Printable view