Search programme

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

​​​

Syllabus for

Academic year
TDA380 - Concurrent programming
 
Owner: TDATA
4,0 Credits (ECTS 6)
Grading: TH - Five, Four, Three, Not passed
Level: A
Department: 0701 - Datavetenskap DI CTH/GU


Course round 1


Teaching language: English

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 No Sp
0101 Examination 3,0 c Grading: TH   3,0 c   08 Mar 2004 pm M,  16 Jan 2004 pm M,  19 Aug 2004 am V
0201 Laboratory 1,0 c Grading: UG   1,0 c    

In programs

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

Examiner:




Course round 2


Teaching language: English

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 No Sp
0101 Examination 3,0 c Grading: TH   3,0 c   24 Oct 2003 pm M,  16 Jan 2004 pm M,  19 Aug 2004 am V
0201 Laboratory 1,0 c Grading: UG   1,0 c    

In programs

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

Examiner:





  Go to Course Homepage

Eligibility:

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

Course specific prerequisites

N/A

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, and 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: occam/ CSP models, extended rendezvous. Monitors. Protected resources; Ada95. Asynchronous coordination; Linda, Erlang.

Organisation

The course is organiserad 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: Thu 03 Nov 2022.