Abstract
Deadlock is an undesired situation in multithreaded software since it can lead to the stoppage of software. This paper studies the problem of deadlock control of multithreaded software based on Gadara nets, which are well studied for modelling concurrent programs. In particular, an iterative deadlock prevention policy based on siphons is proposed for a class of ordinary Gadara nets where the initial marking of each idle place is one. At each iteration, we compute emptiable siphons containing the smallest number of resource places. Then, bad markings are computed based on these siphons. On the basis of the bad markings, a constraint is constructed that forbids not only bad markings that empty one of the siphons but also some other bad markings. The algorithm is carried out until no emptiable siphon exists in the net. Compared with the existing methods, the resultant net derived from the proposed method is live and maximally permissive with a simpler supervisor. Finally, two examples are provided to illustrate the proposed deadlock prevention policy.
Highlights
The transformation of computer hardware from a single processor core to multiple processor cores has promoted the emergence of multi-threaded parallel programming systems (MPPS)
We proposes an iterative deadlock prevention policy for a class of Gadara nets to ensure that the controlled net is live and maximally permissive and with low structural complexity
The deadlock prevention policy proposed in this paper focuses on a class of minimal emptiable siphons defined as follows
Summary
The transformation of computer hardware from a single processor core to multiple processor cores has promoted the emergence of multi-threaded parallel programming systems (MPPS). Duo et al.: Deadlock Prevention Policy for a Class of Multithreaded Software methods of discrete event systems [22] They can describe the inherent dynamics of the systems accurately and intuitively, while avoid state enumeration. ICOG scheme is maximally permissive and its computational complexity depends on the algorithm of siphon detection only, the controlled net synthesized by ICOG may face the problem of adding multiple monitor places. We proposes an iterative deadlock prevention policy for a class of Gadara nets to ensure that the controlled net is live and maximally permissive and with low structural complexity.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
