A domain specific language based approach for generating deadlock-free parallel load scheduling protocols for distributed systems
<p>In this dissertation, the concept of using domain specific language to develop error-free parallel asynchronous load scheduling protocols for distributed systems is studied. The motivation of this study is rooted in addressing the high cost of verifying parallel asynchronous load scheduling...
Main Author: | Adhikari, Pooja |
---|---|
Other Authors: | Edward Allen Luke |
Format: | Others |
Language: | en |
Published: |
MSSTATE
2013
|
Subjects: | |
Online Access: | http://sun.library.msstate.edu/ETD-db/theses/available/etd-03132013-153807/ |
Similar Items
-
Optimizing Job Coscheduling by Adaptive Deadlock-Free Scheduler
by: Zhishuo Zheng, et al.
Published: (2018-01-01) -
Deadlock free algorithmic parallelism : analysis, implementation and performance
by: Simpson, D. P.
Published: (2003) -
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
by: Fuad Abujarad, et al.
Published: (2009-12-01) -
Deadlock Free Specification based on Local Process Properties
by: Simpson, Duncan, et al.
Published: (2003) -
Controllable Deadlocks in Parallel Resource-Constrained Workflows
by: V. A. Bashkin, et al.
Published: (2014-12-01)