A thread-safe implementation of a meta-programmable data model

Abstract

This thesis describes the design and implementation of a thread-safe meta-programmable data model that can be used in a multi-threaded environment without the need for user defined synchronization. The locking mechanisms used to provide thread safety are described, and a proof of deadlock freedom for the data model is provided. A case study is presented in which the data model is used to implement the data structures for a sequential and parallelized version of an algorithm, and the performance using multiple threads is measured against the ideal possible speedup for the parallelized algorithm.