| dc.creator | Balasubramanian, Daniel Allen | |
| dc.date.accessioned | 2020-08-22T00:18:11Z | |
| dc.date.available | 2010-04-25 | |
| dc.date.issued | 2008-04-25 | |
| dc.identifier.uri | https://etd.library.vanderbilt.edu/etd-03312008-161927 | |
| dc.identifier.uri | http://hdl.handle.net/1803/11829 | |
| dc.description.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. | |
| dc.format.mimetype | application/pdf | |
| dc.subject | Data structure (Computer science) | |
| dc.subject | Threads (Computer programs) | |
| dc.subject | Model-integrated computing | |
| dc.subject | data model | |
| dc.subject | thread safe | |
| dc.subject | meta programmable | |
| dc.subject | Domain-specific programming languages | |
| dc.title | A thread-safe implementation of a meta-programmable data model | |
| dc.type | thesis | |
| dc.contributor.committeeMember | Dr. Sandeep Neema | |
| dc.type.material | text | |
| thesis.degree.name | MS | |
| thesis.degree.level | thesis | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | Vanderbilt University | |
| local.embargo.terms | 2010-04-25 | |
| local.embargo.lift | 2010-04-25 | |
| dc.contributor.committeeChair | Dr. Gabor Karsai | |
