Filters








170 Hits in 3.5 sec

On implementing omega with weak reliability and synchrony assumptions

Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg
2003 Proceedings of the twenty-second annual symposium on Principles of distributed computing - PODC '03  
We study the feasibility and cost of implementing Ω-a fundamental failure detector at the core of many algorithms-in systems with weak reliability and synchrony assumptions.  ...  We then show that with a small additional assumption-the existence of some unknown correct process whose asynchronous links are lossy but fair-we can implement Ω efficiently: we give an algorithm for Ω  ...  In this paper, we study the problem of implementing Ω in systems with weak reliability and synchrony assumptions, and we are particularly interested in communication-efficient implementations.  ... 
doi:10.1145/872035.872081 dblp:conf/podc/AguileraDFT03 fatcat:libfb7u24fe65hmajz4zfcmxme

On implementing omega in systems with weak reliability and synchrony assumptions

Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg
2008 Distributed computing  
We study the feasibility and cost of implementing Ω -a fundamental failure detector at the core of many algorithms -in systems with weak reliability and synchrony assumptions.  ...  Previously known algorithms for Ω worked only in systems that are strictly stronger than S in terms of reliability or synchrony assumptions.  ...  In summary, we investigate the feasibility and cost of implementations of Ω -a fundamental failure detector at the core of many algorithms -in systems with weak reliability and synchrony assumptions.  ... 
doi:10.1007/s00446-008-0068-y fatcat:ayyl7qlo7nernlzyejskiorbfy

Eventual Leader Election in the Crash-Recovery Failure Model

Cristian Martín, Mikel Larrea
2008 2008 14th IEEE Pacific Rim International Symposium on Dependable Computing  
After that, an algorithm implementing Omega under some weak assumptions on communication reliability and synchrony is proposed.  ...  A particular failure detector called Omega has been shown to be the weakest for solving consensus with a majority of correct processes.  ...  Acknowledgments Research partially supported by the Spanish Research Council, under grants TIN2007-67353-C02-02 and TIN2006-15617-C03-01, the Basque Government, under grant S-PE07IK03, and the Comunidad  ... 
doi:10.1109/prdc.2008.10 dblp:conf/prdc/MartinL08 fatcat:q2iogzfkv5cxjkspbb7l6m6y24

Implementing the weakest failure detector for solving the consensus problem

Mikel Larrea, Antonio Fernández Anta, Sergio Arévalo
2013 International Journal of Parallel, Emergent and Distributed Systems  
In this paper, algorithms that implement failure detectors in partially synchronous systems are presented.  ...  The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures.  ...  As said above, two algorithms implementing OS in a system with weak synchrony are first presented.  ... 
doi:10.1080/17445760.2012.753180 fatcat:ja3qnkndazchncssoeiflsilwa

A Comprehensive Study on Failure Detectors of Distributed Systems

Bhavana Chaurasia, Anshul Verma
2020 Journal of scientific research  
A comprehensive study is presented based on properties, methodologies used, the applicability of systems, and outcomes of the failure detectors.  ...  Accuracy and completeness are the key attributes to measure the quality of failure detectors.  ...  A failure detector of the Perfect P class was developed with properties like strong partition synchrony and timeliness oracle for this type of system.  ... 
doi:10.37398/jsr.2020.640235 fatcat:znckxyrnnnf3npesjkjtifjde4

A simple and communication-efficient Omega algorithm in the crash-recovery model

Cristian Martín, Mikel Larrea
2010 Information Processing Letters  
This paper presents a new algorithm implementing the Omega failure detector in the crash-recovery model.  ...  ., those that crash and recover infinitely often, output a special ⊥ value upon recovery, and then agree with correct processes on the leader after receiving a first message from it.  ...  They differ in aspects like the communication reliability and synchrony assumptions (e.g., the number of eventually timely and of fair lossy links), the communication pattern among processes (all-to-all  ... 
doi:10.1016/j.ipl.2009.10.011 fatcat:iykjppsyozacfepggstgkhn5ki

Assessing interactions of linear and nonlinear neuronal sources using MEG beamformers: a proof of concept

Avgis Hadjipapas, Arjan Hillebrand, Ian E. Holliday, Krish D. Singh, Gareth R. Barnes
2005 Clinical Neurophysiology  
However, beamformer methodology is based on the assumption of no linear long-term source interdependencies [VanVeen BD, vanDrongelen W, Yuchtman M, Suzuki A.  ...  Conclusions: MEG beamformer methods in conjunction with analysis of source interdependencies could provide accurate spatial and temporal descriptions of interactions between linear and nonlinear neuronal  ...  This consistent with the reliability and RDM measures of the temporal performance of the beamformer in Figs. 4 and 5. 4) ) as a function of the relative duration of transient source correlation with  ... 
doi:10.1016/j.clinph.2005.01.014 pmid:15978493 fatcat:355zot24q5akng6uwnambzgmlm

Does Neuronal Synchrony Underlie Visual Feature Grouping?

Ben J.A. Palanca, Gregory C. DeAngelis
2005 Neuron  
It 1999; Riesenhuber and Poggio, 1999; Shadlen and is known that there are dense interconnections among Movshon, 1999; Singer, 1999). neurons with overlapping RFs (Gilbert and Wiesel, One proposed solution  ...  Multiunit (MU) recordings chrony in spiking activity shows little dependence on were taken from pairs of sites in the middle temporal feature grouping, whereas gamma band synchrony in (MT) area with overlapping  ...  into gray with no criteria based on synchrony strength.  ... 
doi:10.1016/j.neuron.2005.03.002 pmid:15848810 fatcat:45arbmmpwffo7k34466acd2u5q

Impact FD: An Unreliable Failure Detector Based on Process Relevance and Confidence in the System

Anubis Graciela de Moraes Rossetto, Cláudio F R Geyer, Luciana Arantes, Pierre Sens
2018 Computer journal  
Similarly, we are interested in implementing the Impact FD on asynchronous systems enriched with additional assumptions.  ...  Chapter 5 presents three algorithms (and their respective proofs of correctness) that implement the Impact FD, considering different synchrony assumptions, implementation choices (message-pattern and timer-based  ...  14 implements a Impact FD that runs on a R-S-δ-Π system.  ... 
doi:10.1093/comjnl/bxy041 fatcat:nkusonkfdrhkzp3k7if22ihsmq

The Local Field Potential Reflects Surplus Spike Synchrony

Michael Denker, Sébastien Roux, Henrik Lindén, Markus Diesmann, Alexa Riehle, Sonja Grün
2011 Cerebral Cortex  
Here we present experimental evidence to reconcile the notions of synchrony at the level of neuronal spiking and at the mesoscopic scale.  ...  This finding provides direct evidence for the hypothesized relation that precise spike synchrony constitutes a major temporally and spatially organized component of the LFP.  ...  We interpret the observed excess synchrony as the result of the specific and reliable coactivation of the neurons as part of an assembly.  ... 
doi:10.1093/cercor/bhr040 pmid:21508303 pmcid:PMC3209854 fatcat:fy7skiq3xffhdk2sw4ofj7blpi

Crash fault detection in celerating environments

Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
2009 2009 IEEE International Symposium on Parallel & Distributed Processing  
The well-known "eventually perfect" failure detector, 3P, has been implemented in partially synchronous systems with unknown upper bounds on message delay and relative process speeds.  ...  However, previous implementations have overlooked an important subtlety with respect to measuring the passage of time in "celerating" environments, in which absolute process speeds can continually increase  ...  Acknowledgments We would like to thank the anonymous reviewers for their valuable comments and suggestions which have been incorporated in the document. This work was sup-  ... 
doi:10.1109/ipdps.2009.5161050 dblp:conf/ipps/SastryPW09 fatcat:qxqzrdywsbaznfzldf6t3ibn3y

Eventual election of multiple leaders for solving consensus in anonymous systems

Ernesto Jiménez, Sergio Arévalo, Carlos Herrera, Jian Tang
2015 Journal of Supercomputing  
In [17] , consensus in anonymous systems with different synchrony assumptions is also solved (that is, they assume that the system is not totally asynchronous but with partial synchrony).  ...  augmented with AQ' and where a majority of processes does not crash.  ...  messages (recall that the links are reliable), what contradicts the initial assumption, completing the proof. • Lemma 8 Let pi be a leader process in run R.  ... 
doi:10.1007/s11227-015-1460-6 fatcat:gpyw2uczojfx7j3ztctturuy3u

Characterizing hippocampal dynamics with MEG: A systematic review and evidence‐based guidelines

Emily Ruzich, Maité Crespo‐García, Sarang S. Dalal, Justin F. Schneiderman
2018 Human Brain Mapping  
activity originating in the hippocampus with MEG.  ...  While localizing activity to specific sub-structures within the hippocampus has not been achieved, we provide recommendations for improving the reliability of such endeavors.  ...  requirements and best conditions for which hippocampal activity can be reliably detected and localized with MEG.  ... 
doi:10.1002/hbm.24445 pmid:30378210 pmcid:PMC6456020 fatcat:7wtmrt7jqbedxkq4ln7uikful4

Binding under Conflict Conditions: State–Space Analysis of Multivariate EEG Synchronization

Maria G. Knyazeva, Cristian Carmeli, Eleonora Fornari, Reto Meuli, Michael Small, Richard S. Frackowiak, Philippe Maeder
2011 Journal of Cognitive Neuroscience  
■ Real-world objects are often endowed with features that violate Gestalt principles.  ...  MD) was associated with a higher posterior synchronization in the beta-gamma band.  ...  The supplementary analysis showed a few sensors with significant but relatively weak stimulus effects on EEG energy ( Figure S2 ).  ... 
doi:10.1162/jocn.2010.21588 pmid:20946055 fatcat:7w62ae2bm5b7na4e2rbqi43qeu

A framework for proving the self-organization of dynamic systems [article]

Emmanuelle Anceaume, Maria Potop-Butucaru
2010 arXiv   pre-print
The first ones are two representative P2P overlays (CAN and Pas- try) and the others are specific implementations of \Omega (the leader oracle) and one-shot query abstractions for dynamic settings.  ...  Our study aims at understanding the limits and respective power of existing self-organized protocols and lays the basis of designing robust algorithm for dynamic systems.  ...  Acknowledgments We thank Lisa Higham and Joffroy Beauquier for their valuable comments on an earlier version of this paper.  ... 
arXiv:1011.2312v1 fatcat:6khebiadifa4ffgyb22s5wt5sa
« Previous Showing results 1 — 15 out of 170 results