Project number 9993
Concurrent data structures allow concurrent execution of their operations in order to gain efficiency on parallel architectures.
In recent years, a number of lock-free and wait-free algorithms have been proposed and some of them also implemented (eg. in Java concurrency utilities).
In this project, concurrent data structures are to be analyzed. Emphasis may be put on either:
In both cases, new algorithms may be developed.
Relevant courses: 02152 Concurrent Systems, 02105 AD1, preferably 02110 AD2.
Hans Henrik Løvengreen
Paul Fischer
Martin Gjældbæk