Beta 1


Title Concurrent Data Structures
Author Stockel, Morten
Bøg, Søren
Supervisor Fischer, Paul (Algorithms and Logic, Department of Informatics and Mathematical Modeling, Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark)
Løvengreen, Hans Henrik (Embedded Systems Engineering, Department of Informatics and Mathematical Modeling, Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark)
Institution Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark
Thesis level Bachelor thesis
Year 2008
Abstract As multi processor computer system are becoming increasingly popular, there is great pressure to develop standard data structures which are safe to use in multiprocessor environment and ideally perform better in these environments than their classical counterparts. This report examines the difficult job of creating these data structures. It examines both the development of the data structures, proving the correctness of the data structure and finally testing the performance of the result. The report contains multiple implementations of both disjoint set and heap data structure which are compared and contrasted in an attempt to determine the optimal methods for creating concurrent data structures.
Series IMM-B.Sc.-2008-12
Fulltext
Original PDF bac08_12_net.pdf (2.86 MB)
Admin Creation date: 2008-07-01    Update date: 2008-09-25    Source: dtu    ID: 221221    Original MXD