Results 31 to 40 of about 119,463 (291)

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.
Bishop, J., Lo, J., Renaud, K., Worrall, B., Zyl, P.v.   +4 more
core   +1 more source

A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network [PDF]

The Computer Journal, 1988
Summary: A distributed algorithm for mutual exclusion is presented. No particular assumptions on the network topology are required, except connectivity; the communication graph may be arbitrary. The processes communicate by using messages only and there is no global controller. Furthermore, no process needs to know or learn the global network topology.
Jean-Michel Hélary, Noël Plouzeau, Michel Raynal   +2 more
openaire   +2 more sources

A systematic review and knowledge mapping on ICT-based remote and automatic COVID-19 patient monitoring and care

BMC Health Services Research, 2023
Background e-Health has played a crucial role during the COVID-19 pandemic in primary health care. e-Health is the cost-effective and secure use of Information and Communication Technologies (ICTs) to support health and health-related fields.
Ayan Chatterjee, Andreas Prinz, Michael A. Riegler, Jishnu Das   +3 more
doaj   +1 more source

High‐contention mutual exclusion by elevator algorithms [PDF]

Concurrency and Computation: Practice and Experience, 2018
SummaryThis paper presents new starvation‐free hardware‐assisted and software‐only algorithms for the N‐thread mutual‐exclusion problem. The hardware‐assisted versions use a single atomic‐CAS instruction and no fences. The software‐only algorithms simulate the CAS instruction using a variation of Burns‐Lamport (1 fence) or Lamport's fast algorithm (3 ...
Peter A. Buhr, David Dice, Wim H. Hesselink   +2 more
openaire   +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

Large‐scale bidirectional arrayed genetic screens identify OXR1 and EMC4 as modifiers of αSynuclein aggregation

FEBS Open Bio, EarlyView.
Activation of the mitochondrial protein OXR1 increases pSyn129 αSynuclein aggregation by lowering ATP levels and altering mitochondrial membrane potential, particularly in response to MSA‐derived fibrils. In contrast, ablation of the ER protein EMC4 enhances autophagic flux and lysosomal clearance, broadly reducing α‐synuclein aggregates.
Sandesh Neupane, Lea Nikolić, Lorenzo Maraio, Thomas Goiran, Nathan Karpilovsky, Stefano Sellitto, Vangelis Bouris, Jiang‐An Yin, Ronald Melki, Edward A Fon, Adriano Aguzzi, Elena De Cecco   +11 more
wiley   +1 more source

Peterson's mutual exclusion algorithm revisited

Science of Computer Programming, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sommen, van der, F.W., Feijen, W.H.J., Gasteren, van, A.J.M.   +2 more
openaire   +3 more sources

How to decide? Different methods of calculating gene expression from short oligonucleotide array data will give different results

BMC Bioinformatics, 2006
Background Short oligonucleotide arrays for transcript profiling have been available for several years. Generally, raw data from these arrays are analysed with the aid of the Microarray Analysis Suite or GeneChip Operating Software (MAS or GCOS) from ...
Voesenek Laurentius ACJ, van Zanten Martijn, May Sean T, Okyere John, Millenaar Frank F, Peeters Anton JM   +5 more
doaj   +1 more source

Modal µ-Calculus, Model Checking and Gauß Elimination [PDF]

, 1995
In this paper we present a novel approach for solving Boolean equation systems with nested minimal and maximal fixpoints. The method works by successively eliminating variables and reducing a Boolean equation system similar to Gauß elimination for linear
Mader, Angelika
core   +4 more sources

A simple taxonomy for distributed mutual exclusion algorithms

ACM SIGOPS Operating Systems Review, 1991
This short paper examines the two basic principles from which distributed mutual exclusion algorithms are designed : permission-based and token-based principles.
M. Raynal
semanticscholar   +1 more source