And/or-convexity: a graph convexity based on processes and deadlock models

Carlos V. G. C. Lima (), Fábio Protti (), Dieter Rautenbach (), Uéverton S. Souza () and Jayme L. Szwarcfiter ()
Additional contact information
Carlos V. G. C. Lima: Federal University of Rio de Janeiro
Fábio Protti: Fluminense Federal University
Dieter Rautenbach: Ulm University
Uéverton S. Souza: Fluminense Federal University
Jayme L. Szwarcfiter: Federal University of Rio de Janeiro

Annals of Operations Research, 2018, vol. 264, issue 1, No 10, 267-286

Abstract: Abstract Deadlock prevention techniques are essential in the design of robust distributed systems. However, despite the large number of different algorithmic approaches to detect and solve deadlock situations, yet there remains quite a wide field to be explored in the study of deadlock-related combinatorial properties. In this work we consider a simplified AND-OR model, where the processes and their communication are given as a graph G. Each vertex of G is labelled AND or OR, in such a way that an AND-vertex (resp., OR-vertex) depends on the computation of all (resp., at least one) of its neighbors. We define a graph convexity based on this model, such that a set $$S \subseteq V(G)$$ S ⊆ V ( G ) is convex if and only if every AND-vertex (resp., OR-vertex) $$v \in V(G){\setminus }S$$ v ∈ V ( G ) \ S has at least one (resp., all) of its neighbors in $$V(G) {\setminus } S$$ V ( G ) \ S . We relate some classical convexity parameters to blocking sets that cause deadlock. In particular, we show that those parameters in a graph represent the sizes of minimum or maximum blocking sets, and also the computation time until system stability is reached. Finally, a study on the complexity of combinatorial problems related to such graph convexity is provided.

Keywords: Graph convexity; Deadlock; AND-OR model; And/or graphs (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2666-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:264:y:2018:i:1:d:10.1007_s10479-017-2666-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2666-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().