Some myths about famous mutual exclusion algorithms

Alagarsamy, K.

doi:10.1145/945526.945527

Cited by 8 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Milner's cyclic scheduler algorithm (ms(N) for N processes) is a showcase for the effectiveness of PAT, in which we apply event-level strong fairness to the whole system. Peterson's mutual exclusive algorithm (peterson(N)) requires at least process-level weak fairness to guarantee bounded bypass [29], i.e., if a process requests to enter the critical section, it eventually will. The property is verified with processlevel weak fairness in PAT and process-level weak fairness in SPIN.…”

Section: Implementation and Experimentsmentioning

confidence: 99%

Model checking with fairness assumptions using PAT

Sun

Liu

et al. 2013

Front. Comput. Sci.

View full text Add to dashboard Cite

Recent development on distributed systems has shown that a variety of fairness constraints (some of which are only recently defined) play vital roles in designing selfstabilizing population protocols. Existing model checkers are deficient in verifying the systems as only limited kinds of fairness are supported with limited verification efficiency. In this work, we support model checking of distributed systems in the toolkit PAT (process analysis toolkit), with a variety of fairness constraints (e.g., process-level weak/strong fairness, event-level weak/strong fairness, strong global fairness). It performs on-the-fly verification against linear temporal properties. We show through empirical evaluation (on recent population protocols as well as benchmark systems) that PAT has advantage in model checking with fairness. Previously unknown bugs have been revealed against systems which are designed to function only with strong global fairness.

show abstract

Section: Implementation and Experimentsmentioning

confidence: 99%

Model checking with fairness assumptions using PAT

Sun

Liu

et al. 2013

Front. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…An automatic discovery approach for mutual exclusion algorithms is presented in [BDT03], however, our aims differ as we are looking for effective techniques to construct concurrent programs, and to reason about them. An analysis of several algorithms that are claimed to be generalizations of Dekker's algorithm is presented in [Ala03]. However, according to [Ala03], these algorithms are not generalizations as they lack the starvation-free property of Dekker's algorithm.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

“…An analysis of several algorithms that are claimed to be generalizations of Dekker's algorithm is presented in [Ala03]. However, according to [Ala03], these algorithms are not generalizations as they lack the starvation-free property of Dekker's algorithm. In contrast, due to individual progress, all our variants satisfy starvation-freedom by construction.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

Streamlining progress-based derivations of concurrent programs

Dongol

Mooij

2008

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. The logic of Owicki and Gries is a well known logic for verifying safety properties of concurrent programs. Using this logic, Feijen and van Gasteren describe a method for deriving concurrent programs based on safety. In this work, we explore derivation techniques of concurrent programs using progress-based reasoning. We use a framework that combines the safety logic of Owicki and Gries, and the progress logic of UNITY. Our contributions improve the applicability of our earlier techniques by reducing the calculational overhead in the formal proofs and derivations. To demonstrate the effectiveness of our techniques, a derivation of Dekker's mutual exclusion algorithm is presented. This derivation leads to the discovery of some new and simpler variations of this famous algorithm.

show abstract

“…Ejemplos de lo mencionado se encuentran en [1] y [2], donde se describen los principales algoritmos de sincronización en sistemas distribuidos, en [3], donde se presenta una solución eficiente y tolerante a fallas para el problema de la exclusión mutua distribuida, en [4], [5] y en [6], donde se presentan unos algoritmos para gestionar la exclusión mutua en redes de computadoras, en [7], donde se describen los principales algoritmos de sincronización en sistemas distribuidos, en [8], donde se detallan los principales algoritmos para la gestión distribuida de procesos, los estados globales distribuidos y la exclusión mutua distribuida. Estos temas y otros relacionados también han sido tratados en [9] y [10], etc.…”

Section: Introductionunclassified

Simulador para la evaluación de algoritmos para la gestión de recursos compartidos en sistemas distribuidos

Martínez

Agostini

Acosta

et al. 2022

RITI

View full text Add to dashboard Cite

In distributed processing systems, especially when processes constitute collaborative groups, it is necessary that, when allocating resources to processes, decisions are made based on agreements regarding access to resources; decisions may be related to the performance of a certain activity that requires or not the synchronization of processes, requiring the use of shared resources in the mode of mutual exclusion. Thus, the following question arises: What are the decision models and aggregation operators that will have to be generated by incorporating the global cognitive perspective to the classical models to make more intelligent decision making in the management of resources and groups of processes taking into account self-regulation? How will the algorithms of the different decision models be implemented? How to validate the new proposed algorithms by comparing them with each other and with traditional algorithms? For this, it is necessary to have a simulator that implements the traditional and the new proposed algorithms and allows to observe their behavior and results under different types of workloads. Classical models are considered for accessing shared resources in the mutual exclusion mode using critical regions to the centralized algorithm, the distributed algorithm of Lamport, Ricart and Agrawala, the token ring algorithm, among others. A prototype simulator is presented to evaluate the performance of the proposed new decision models and aggregation operators against the main traditional models.

show abstract

Some myths about famous mutual exclusion algorithms

Cited by 8 publications

References 9 publications

Model checking with fairness assumptions using PAT

Model checking with fairness assumptions using PAT

Streamlining progress-based derivations of concurrent programs

Simulador para la evaluación de algoritmos para la gestión de recursos compartidos en sistemas distribuidos

Contact Info

Product

Resources

About