QSpace at Queen's University >
Graduate Theses, Dissertations and Projects >
Queen's Graduate Theses and Dissertations >
Please use this identifier to cite or link to this item:
|Title: ||Generation of Concurrency Controls using Discrete-Event Systems|
|Authors: ||Dragert, Christopher|
|Keywords: ||Computer Science|
|Issue Date: ||2008|
|Series/Report no.: ||Canadian theses|
|Abstract: ||The development of controls for the execution of concurrent code is non-trivial. This work shows how existing discrete-event system (DES) theory can be successfully applied to this problem. From code without concurrency controls and a specification of desired behaviours, a DES representation of the problem is obtained, and then used to generate concurrency control code. By applying rigorously proven DES theory, the resulting code comes with guarantees not present in similar works. All control schemes generated in DES are nonblocking, yielding code that is free of both livelock and deadlock. Additionally, the generated control scheme is minimally restrictive, meaning only problematic behaviours are prevented.
If the specifications cannot be enforced as presented, the largest controllable subset is instead enforced. The result, which requires no further interaction to generate, is the best possible control scheme given the interaction between the specifications and the original code. Existing methods encounter difficulties when faced with multiple specifications that interact to form deadlocks. Modular DES theory is successfully applied, allowing resolution of these conflicts without requiring the user to introduce new specifications. Moreover, the approach is independent of specific programming or specification languages. A Java implementation is given, along with two problems showing the process in action.|
|Description: ||Thesis (Master, Computing) -- Queen's University, 2008-09-25 09:03:51.593|
|Appears in Collections:||Queen's Graduate Theses and Dissertations|
School of Computing Graduate Theses
Items in QSpace are protected by copyright, with all rights reserved, unless otherwise indicated.