|
|
|
|
| Bachelorprojekt - Softwareteknologi | Project No. 0030: Concurrent Data Structures |
| Aktuelle | Tidligere |
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.
| Prerequisites: | 01258 Concurrent Programming and preferably 02110 Algorithms & Datastructrures 2 |
Restrictions: In the Spring 2010, this project is limited to 1-2 groups
Supervisor(s) Hans Henrik Løvengreen and Paul Fischer
| Sidst opdateret: Oct 31, 2011 af Hans Henrik Løvengreen |