Symbolic computation and representation of deadlock avoidance policies for complex resource allocation systems with application to multithreaded software
Paper i proceeding, 2015

In our recent work, we proposed a series of binary decision diagram (BDD-) based approaches for developing the maximally permissive deadlock avoidance policy (DAP) for a class of complex resource allocation systems (RAS). In this paper, (i) we extend these approaches by introducing a procedure that generates a set of comprehensible 'guard' predicates to represent the resulting DAP, and (ii) we customize them to the problem of deadlock avoidance in shared-memory multithreaded software, that has been previously addressed by the Gadara project. In the context of this last application, the generated guards can be instrumented directly into the source code of the underlying software threads, providing, thus, a very efficient and natural representation of the target policy. At the same time, by integrating the representational and computational strengths of symbolic computation, the presented approach can support the computation of the maximally permissive DAP for RAS corresponding to problem instances of even larger scale and complexity than those addressed in the current literature.

Författare

Zhennan Fei

Chalmers, Signaler och system, System- och reglerteknik, Automation

K. Akesson

S. Reveliotis

Proceedings of the 53rd IEEE Annual Conference on Decision and Control, CDC 2014, Los Angeles, United States, 15-17 December 2014

0743-1546 (ISSN)

5935-5942

Ämneskategorier

Elektroteknik och elektronik

DOI

10.1109/CDC.2014.7040318

ISBN

978-1-4799-7746-8

Mer information

Skapat

2017-10-07