Results 11 to 20 of about 2,467,903 (217)

Hierarchical token based mutual exclusion algorithms [PDF]

, 2004
Mutual exclusion is a basic block of distributed synchronization algorithms. One of the challenge in highly distributed environments (like peer-to-peer or Grid configurations) is to provide scalable synchronizations taking into account the hierarchical ...
Sens, Pierre, Arantes, Luciana, Bertier, Marin   +2 more
core   +5 more sources

Algon: a framework for supporting comparison of distributed algorithm performance [PDF]

, 2003
Programmers often need to use distributed algorithms to add non-functional behaviour such as mutual exclusion, deadlock detection and termination, to a distributed application.
B. Worrall, P. van Zyl, Worrall, B., J. Lo, K. Renaud, Lo, J., J. Bishop, Renaud, K., Zyl, P.v., Bishop, J.   +9 more
core   +1 more source

Mutual Exclusion by Interpolation [PDF]

, 2012
The question of what constraints must hold for a predicate to behave as a (partial) function, is key to understanding the behaviour of a logic program. It has been shown how this question can be answered by combining backward analysis, a form of analysis
Jael Kriener, Andy King, King, Andy, Kriener, Jael   +3 more
core   +1 more source

Recoverable mutual exclusion

, 2019
This is a post-peer-review, pre-copyedit version of an article published in Distributed Computing. The final authenticated version is available online at: Golab, W., & Ramaraju, A. (2019). Recoverable mutual exclusion.
Ramaraju, Aditya, Golab, Wojciech
core   +1 more source

Formal Analysis of Bakery-Based Mutual Exclusion Algorithms

Computers
Lamport’s Bakery algorithm (LBA) represents a general and elegant solution to the mutual exclusion (ME) problem posed by Dijkstra in 1965. Its correctness is usually based on intuitive reasoning.
Libero Nigro
doaj   +1 more source

Distributed mutual exclusion algorithms

, 1993
In this thesis we present three original algorithms which solve the distributed mutual exclusion problem. Two of the three solve the problem of allowing only one site at a time into the critical section.
Banta, Paul
core   +1 more source

WORKING PROGRAM FOR STUDENT COURSE «DISTRIBUTED COMPUTING SCHEDULING» AND METHODICAL SUPPORT DESCRIPTION

Современные информационные технологии и IT-образование, 2018
The article describes working program for student course B1.V.04 «Distributed Computing Scheduling» which is taught during second semester of master course 01.04.02 «Applied Mathematics and Informatics» of «Math modeling» specialty.
Yuliana A. Kryzhanovskaya
doaj   +1 more source

A Minimal Supervisory Structure to Optimally Enforce Liveness on Petri Net Models for Flexible Manufacturing Systems

IEEE Access, 2017
This paper presents a new method of computing a minimal supervisory structure that optimally enforces liveness on the Petri net models for flexible manufacturing systems (FMSs).
Muhammad Bashir, Zhiwu Li, Murat Uzam, Abdulrahman Al-Ahmari, Naiqi Wu, Ding Liu, Ting Qu   +6 more
doaj   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

FEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source

A General scheme for token and tree based distributed mutual exclusion algorithms [PDF]

, 1992
In a distributed context, mutual exclusion algorithms can be divided into two families according to their underlying algorithmic principles: those which are permission-based and those which are token-based.
Hélary, Jean-Michel, Mostefaoui, Achour, Raynal, Michel   +2 more
core   +3 more sources