Distributed Cycle Detection and Removal

Oliva, Gabriele; Setola, Roberto; Glielmo, Luigi; Hadjicostis, Christoforos N.

doi:10.1109/tcns.2016.2593264

Cited by 9 publications

(5 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm in [30], also designed for the bulk-synchronous model, uses an approach different from the "append-and-forward" technique. This approach uses the fact that, in directed graphs, a cycle cannot pass through nodes of in-degree or out-degree 0.…”

Section: Distributed Cycle Detectionmentioning

confidence: 99%

See 1 more Smart Citation

Distributed Detection of Cycles

Fraigniaud

Olivetti

2019

ACM Trans. Parallel Comput.

View full text Add to dashboard Cite

Distributed property testing in networks has been introduced by Brakerski and Patt-Shamir [6], with the objective of detecting the presence of large dense sub-networks in a distributed manner. Recently, Censor-Hillel et al. [7] have revisited this notion and formalized it in a broader context. In particular, they have shown how to detect 3-cycles in a constant number of rounds by a distributed algorithm. In a follow-up work, Fraigniaud et al. [21] have shown how to detect 4-cycles in a constant number of rounds as well. However, the techniques in these latter works were shown not to generalize to larger cycles C k with k ≥ 5. In this article, we completely settle the problem of cycle detection by establishing the following result: For every k ≥ 3, there exists a distributed property testing algorithm for C k -freeness, performing in a constant number of rounds. All these results hold in the classical congest model for distributed network computing. Our algorithm is 1-sided error. Its round-complexity is O (1ϵ) where ϵ ∈ (0,1) is the property-testing parameter measuring the gap between legal and illegal instances.

show abstract

Section: Distributed Cycle Detectionmentioning

confidence: 99%

“…Hence, one can remove all nodes with in-degree or out-degree 0 from the digraph, iteratively, until the digraph becomes empty, or no more nodes can be removed. It is proved in [30] that the digraph becomes empty if and only if it does not contain a cycle. This approach is bandwidth efficient.…”

Section: Distributed Cycle Detectionmentioning

confidence: 99%

Distributed Detection of Cycles

Fraigniaud

Olivetti

2019

ACM Trans. Parallel Comput.

View full text Add to dashboard Cite

show abstract

“…This graph (MST) connects all the vertices together, without any cycles and with the minimum possible total edge weight, so it does not allow the direct identification of cycles (for us physical loops). In parallel, other topological approaches exist in the literature to detect loops (or cycles) in directed and undirected graphs [51,52]. However, the only traditional methods that ensure the detection of cycles within a directed or undirected graph rely on DFS [51,53].…”

Section: Discussion and Future Workmentioning

confidence: 99%

“…In parallel, other topological approaches exist in the literature to detect loops (or cycles) in directed and undirected graphs [51,52]. However, the only traditional methods that ensure the detection of cycles within a directed or undirected graph rely on DFS [51,53]. These methods exploit the fact that a graph has a loop/ cycle if, and only if, the DFS method reaches a so-called "back edge" (detected by keeping the list of visited nodes and verifying for rehearsed entries in the list).…”

Section: Discussion and Future Workmentioning

confidence: 99%

Topological approach for assessment of electromagnetic interferences to support mechatronic conceptual design

Kharrat

Penas

Kharrat

et al. 2020

Mechanics & Industry

View full text Add to dashboard Cite

The conceptual design is a crucial phase for the System Architects to evaluate 3D architecture concepts of mechatronic systems mainly with regard to the ElectroMagnetic Compatibility (EMC). Our research work deals with the combination of electromagnetic modeling and a topological approach to support the qualitative and quantitative ElectroMagnetic Interferences (EMI) evaluation process within the MBSE SAMOS approach as of the conceptual design. For a given interference, the analysis of topological models allows the qualitative identification of the existence of victims with their associated potential aggressors, based on the electrical schema of interacting components. Then, once the potential EMIs have been qualitatively identified, a quantitative evaluation can be performed based on the predefined electromagnetic and geometrical requirements, and on the analysis of the identified physical coupling law. Finally, this approach has been applied to the alien crosstalk occurring in an electrical vehicle powertrain, with a quantitative evaluation based on the two following methods: an analytical approach and Kron's approach.

show abstract

“…Cycle detection has been investigated in various parallel and distributed computing frameworks, in particular for its connection to deadlock detection in routing or databases. We refer to, e.g., [5,8,9,28] for cycle detection in message passing, bulk-synchronization, self-stabilizing, and other models of parallel and distributed computing.…”

Section: Distributed Cycle Detectionmentioning

confidence: 99%

Distributed Detection of Cycles

Fraigniaud

Olivetti

2017

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

Distributed property testing in networks has been introduced by Brakerski and Patt-Shamir (2011), with the objective of detecting the presence of large dense sub-networks in a distributed manner. Recently, Censor-Hillel et al. (2016) have shown how to detect 3-cycles in a constant number of rounds by a distributed algorithm. In a follow up work, have shown how to detect 4-cycles in a constant number of rounds as well. However, the techniques in these latter works were shown not to generalize to larger cycles C k with k ≥ 5. In this paper, we completely settle the problem of cycle detection, by establishing the following result. For every k ≥ 3, there exists a distributed property testing algorithm for C k -freeness, performing in a constant number of rounds. All these results hold in the classical CONGEST model for distributed network computing. Our algorithm is 1-sided error. Its round-complexity is O(1/ ) where ∈ (0, 1) is the property testing parameter measuring the gap between legal and illegal instances.

show abstract

Distributed Cycle Detection and Removal

Cited by 9 publications

References 23 publications

Distributed Detection of Cycles

Distributed Detection of Cycles

Topological approach for assessment of electromagnetic interferences to support mechatronic conceptual design

Distributed Detection of Cycles

Contact Info

Product

Resources

About