Search programme

​Use the search function to search amongst programmes at Chalmers. The study programme and the study programme syllabus relating to your studies are generally from the academic year you began your studies.

Syllabus for

Academic year
TDA381 - Concurrent programming
 
Owner: TKDAT
5,0 Credits (ECTS 7,5)
Grading: TH - Five, Four, Three, Not passed
Level: A
Department: 37 - COMPUTER SCIENCE AND ENGINEERING


Course round 1


Teaching language: Swedish

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 No Sp
0105 Examination 3,0 c Grading: TH   3,0 c   21 Oct 2005 pm V,  13 Jan 2006 pm V,  24 Aug 2006 am V
0205 Laboratory 2,0 c Grading: UG   2,0 c    

In programs

TITEA SOFTWARE ENGINEERING, Year 2 
TITEA SOFTWARE ENGINEERING, Year 4 (elective)
TITEA SOFTWARE ENGINEERING, Year 3 (elective)
TDATA COMPUTER SCIENCE AND ENGINEERING, Year 3 (compulsory)
DCMAS MSc PROGR IN DEPENDABLE COMPUTER SYSTEMS, Year 1 (elective)

Examiner:

Professor  Andrei Sabelfeld
Professor  David Sands



Course round 2


Teaching language: Swedish

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 No Sp
0105 Examination 3,0 c Grading: TH   3,0 c   07 Mar 2006 am V,  13 Jan 2006 pm V
0205 Laboratory 2,0 c Grading: UG   2,0 c    

In programs

TITEA SOFTWARE ENGINEERING, Year 4 (elective)
TITEA SOFTWARE ENGINEERING, Year 3 (elective)
TITEA SOFTWARE ENGINEERING, Year 2 (elective)
TDATA COMPUTER SCIENCE AND ENGINEERING, Year 2 (elective)
TDATA COMPUTER SCIENCE AND ENGINEERING, Year 3 (compulsory)
DCMAS MSc PROGR IN DEPENDABLE COMPUTER SYSTEMS, Year 1 (elective)

Examiner:

Professor  Andrei Sabelfeld
Professor  David Sands




Eligibility:

For single subject courses within Chalmers programmes the same eligibility requirements apply, as to the programme(s) that the course is part of.

Aim

Concurrent programming plays a vital role in systems where many events appear to occur simultaneously. This course aims to provide an introduction to the problems common to concurrent systems such as operating systems, distributed systems and real-time systems.

Goal

You will gain practical knowledge of the programming constructs and techniques offered by modern concurrent programming languages.

Content

General concepts: parallelism, interference, synchronisation, critical regions, mutual exclusion, deadlock, fairness, livelock.
Synchronisation using shared variables; busy waiting. Semaphores. Synchronous message passing: extended rendezvous. Monitors. Protected Objects (Ada95). Asynchronous coordination; Linda, Erlang.

Organisation

The course is organized as lectures and laboratory assignments.

Literature

Currently we are using "Foundations of multithreaded, parallel and distributed programming" by Greg Andrews, Addison Wesley. The literature to be used is announced in advance on the course home page.

Examination

The course is examined by laboratory assignments and a written examination. Possible grades: U, 3, 4, 5.


Page manager Published: Mon 28 Nov 2016.