Concurrency control generation for dynamic threads using discrete-event systems

Auer, Anthony; Dingel, Juergen; Rudie, Karen

doi:10.1016/j.scico.2013.01.007

Cited by 15 publications

(14 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This theorem is a direct result of Theorem 1 presented in [19]. 3 According to Remark 1, this theorem also holds for N G .…”

Section: B Properties Of Gadara Netsmentioning

confidence: 67%

“…For the detected RI empty siphon, we synthesize control logic to prevent it from becoming reachable, and obtain a controlled Gadara net N c G1 . Then, we detect again, over the modified markings of N c G1 , if there is a new RI empty siphon; and synthesize control 3 Liveness of N c G1 is also equivalent to the absence of any empty siphon in the original reachable markings of the net. But we have opted to use the result of Theorem 1 in order to stay close to the developments of the results in [18].…”

Section: A Iterative Control Of Gadara Netsmentioning

confidence: 99%

“…More specifically, we employ modeling and control techniques from discrete-event systems (DES), which have discrete state spaces and event-driven dynamics. While classical control theory, which focuses on time-driven systems, has been successfully applied to computer systems [12], the application of DES to computer systems is more recent; see, e.g., [29], [27], [20], [7], [3], [9], [15], [5]. Concurrent software is a typical example of a DES.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Eliminating Concurrency Bugs in Multithreaded Software: A New Approach Based on Discrete-Event Control

Liao

Wang

Stanley

et al. 2013

IEEE Trans. Contr. Syst. Technol.

View full text Add to dashboard Cite

Abstract-Computer hardware is moving from uniprocessor to multicore architectures. One problem arising in this evolution is that only parallel software can exploit the full performance potential of multicore architectures, and parallel software is far harder to write than conventional serial software. One important class of failures arising in parallel software is circularwait deadlock in multithreaded programs. In our on-going Gadara project, we use a special class of Petri nets, called Gadara nets, to systematically model multithreaded programs with lock allocation and release operations. In this paper, we propose an efficient optimal control synthesis methodology for ordinary Gadara nets that exploits the structural properties of Gadara nets via siphon analysis. Optimality in this context refers to the elimination of deadlocks in the program with minimally restrictive control logic. We formally establish a set of important properties of the proposed control synthesis methodology, and show that our algorithms never synthesize redundant control logic. We conduct experiments to evaluate the efficiency and scalability of the proposed methodology, and discuss the application of our results to real-world concurrent software.

show abstract

“…This theorem is a direct result of Theorem 1 presented in [19]. 3 According to Remark 1, this theorem also holds for N G .…”

Section: B Properties Of Gadara Netsmentioning

confidence: 67%

Section: A Iterative Control Of Gadara Netsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Eliminating Concurrency Bugs in Multithreaded Software: A New Approach Based on Discrete-Event Control

Liao

Wang

Stanley

et al. 2013

IEEE Trans. Contr. Syst. Technol.

View full text Add to dashboard Cite

show abstract

“…They apply Discrete Control internally to the compilation, only for deadlock avoidance, in a way independent of the application. Other works also target deadlock avoidance in computing systems with multi-thread code [7,24].…”

Section: Discrete Feedback Computingmentioning

confidence: 99%

Feedback Control as MAPE-K Loop in Autonomic Computing

Rutten

Marchand

Simon

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract:Computing systems are becoming more and more dynamically reconfigurable or adaptive, to be flexible w.r.t. their environment and to automate their administration. Autonomic computing proposes a general structure of feedback loop to take this into account. In this report, we are particularly interested in approaches where this feedback loop is considered as a case of control loop where techniques stemming from Control Theory can be used to design efficient safe, and predictable controllers. This approach is emerging, with separate and dispersed effort, in different areas of the field of reconfigurable or adaptive computing, at software or architecture level. This report surveys these approaches from the point of view of control theory techniques, continuous and discrete, in their application to the feedback control of computing systems, and proposes interpretations of feedback control loops as MAPE-K loop, illustrated with case studies.

show abstract

“…However, many important problems in computer and software engineering involve qualitative specifications, such as deadlock avoidance, and their solution requires control-theoretic approaches for event-driven systems with discrete state spaces, i.e., Discrete Event Systems (DES). In the last few years, there has been increased interest in solving discrete-event control problems that arise in software and embedded systems; see, e.g., [2][3][4][5][6][7][8][9][10]. In particular, the paradigm of controlling software execution to avoid software defects at run-time is receiving increased attention in the control engineering, programming languages, and operating systems communities.…”

Section: Introductionmentioning

confidence: 99%

Eliminating Concurrency Bugs in Multithreaded Software: An Approach Based on Control of Petri Nets

Lafortune

Wang

Reveliotis

2013

Application and Theory of Petri Nets and Concurrency

View full text Add to dashboard Cite

Abstract. We describe the Gadara project, a research effort whose goal is to eliminate certain classes of concurrency bugs in multithreaded software by controlling the execution of programs at run-time. The Gadara process involves three stages: modeling of the source code at compile time in the form of a Petri net, feedback control synthesis, and control logic implementation into the source code. The feedback control logic is synthesized using techniques from supervisory control of discrete event systems, where the specification captures the avoidance of certain types of concurrency bugs, such as deadlocks. We focus on the case of circularwait deadlocks in multithreaded programs employing mutual exclusion locks for shared data. The application of the Gadara methodology to other classes of concurrency bugs is briefly discussed.

show abstract

Concurrency control generation for dynamic threads using discrete-event systems

Cited by 15 publications

References 34 publications

Eliminating Concurrency Bugs in Multithreaded Software: A New Approach Based on Discrete-Event Control

Eliminating Concurrency Bugs in Multithreaded Software: A New Approach Based on Discrete-Event Control

Feedback Control as MAPE-K Loop in Autonomic Computing

Eliminating Concurrency Bugs in Multithreaded Software: An Approach Based on Control of Petri Nets

Contact Info

Product

Resources

About