39,778 Hits in 3.2 sec

Deterministic Models of Communication Faults [chapter]

Rastislav Královič, Richard Královič
Lecture Notes in Computer Science  
In particular, we focus on deterministic models of faults in synchronous networks, and show how different variations of the model influence the performance bounds of broadcasting algorithms.  ...  In this paper we survey some results concerning the impact of faulty environments on the solvability and complexity of communication tasks.  ...  Case study: broadcasting In this section we demonstrate an evolution of a particular deterministic timeindependent model of omission faults on a problem of broadcasting.  ... 
doi:10.1007/978-3-540-85238-4_4 fatcat:5evrjvyc45bedagmf54a2j5g5e

Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography [chapter]

Alexandre Petrenko
2001 Lecture Notes in Computer Science  
A fault model is understood as a triple, comprising a nite state speci cation, conformance relation and fault domain that is the set of possible implementations.  ...  The annotated bibliography highlights work in the area of algorithmic test generation from formal speci cations with guaranteed fault coverage, i.e., fault model-driven test derivation.  ...  .: Test Generation Driven by User-de ned Fault models. In: Proceedings of the 12 th International Workshop on Testing of Communicating Systems (IWTCS'99).  ... 
doi:10.1007/3-540-45510-8_10 fatcat:u3v5e4762bctznu4zcvfm5t7e4

On Communication Determinism in Parallel HPC Applications

Franck Cappello, Amina Guermouche, Marc Snir
2010 2010 Proceedings of 19th International Conference on Computer Communications and Networks  
This will make sure that specific fault tolerant protocols designed for communication-deterministic and send-deterministic communication patterns stay relevant for a large fraction of applications.  ...  However because they have some non-deterministic communication patterns, fault tolerant protocols designed for communication-deterministic and send-deterministic communication patterns will not work for  ...  Applications Collective Send-Communication-non -Application communication Deterministic Deterministic Seterministic Class calls patterns patterns ScaLAPACK SUMMA x 0 x 0 Deterministic SP  ... 
doi:10.1109/icccn.2010.5560143 dblp:conf/icccn/CappelloGS10 fatcat:n4nljy2cbzdyvo3mnqbd4os2ey

Redesigning the message logging model for high performance

Aurelien Bouteiller, George Bosilca, Jack Dongarra
2010 Concurrency and Computation  
These drawbacks need to be addressed to provide a resilient and fast fault-tolerant MPI library to the HPC community.  ...  We better categorize message events allowing (i) the suppression of intermediate message copies on high performance networks and (ii) the identification of deterministic and nondeterministic events, thus  ...  The advantages of this model are (i) better fitting the actual MPI communication pattern, (ii) removing the need for an intermediate copy of each message, and (iii) allowing implementation of fault-tolerant  ... 
doi:10.1002/cpe.1589 fatcat:nxxpwyrvcndjrfb3jt3yomejgi

On the Value of Community Association for Microgrid Development: Learnings from Multiple Deterministic and Stochastic Planning Designs

Juan David Mina-Casaran, Diego Fernando Echeverry, Carlos Arturo Lozano, Alejandro Navarro-Espinosa
2021 Applied Sciences  
This research seeks to quantify the potential benefits of urban community microgrids, based on the development of planning models with deterministic and stochastic optimization approaches.  ...  Furthermore, it was found that for approximately 90% of the planned microgrids with reliability requirements, the deterministic solution for the worst three fault scenarios is equivalent to the solution  ...  The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.  ... 
doi:10.3390/app11146257 fatcat:hyk2cr4wojhfxid7vnkqespkc4

Hypercube message routing in the presence of faults

F. M. Gordon, Q. F. Stout
1988 Proceedings of the third conference on Hypercube concurrent computers and applications Architecture, software, computer systems, and general issues -  
In our study, a fault is assumed to render the processor or link non-functional for purposes of communicating messages.  ...  As such, we may also consider communications hot spots as node faults, and our results also apply to routing in congested hypercubes.  ...  We present a notion of faults which is strong enough to model permanent processor failures as well as processors which become communications hot spots.  ... 
doi:10.1145/62297.62332 fatcat:nvoxb4mmmjbcbacwtyqnjpq24e

FSM Based Interoperability Testing Methods for Multi Stimuli Model [chapter]

Khaled El-Fakih, Vadim Trenkaev, Natalia Spitsyna, Nina Yevtushenko
2004 Lecture Notes in Computer Science  
In this paper, we propose two fault models and methods for the derivation of interoperability test suites when the system implementation is given in the form of two deterministic communicating finite state  ...  A test suite returned by the first method enables us to determine if the implementation is free of livelocks.  ...  In the first part of the paper, we present a fault model and a method for interoperability testing for livelocks when the system implementation is given in the form of two deterministic communicating finite  ... 
doi:10.1007/978-3-540-24704-3_5 fatcat:bmdrla63vfcilcd32l5orweq5i

Stochastic and deterministic fault detection for randomized gossip algorithms

Daniel Silvestre, Paulo Rosa, João P. Hespanha, Carlos Silvestre
2017 Automatica  
A fault is a disturbance signal injected by an attacker to corrupt the states of the nodes.  ...  This paper addresses the problem of detecting faults in linear randomized gossip algorithms, where the selection of the dynamics matrix is stochastic.  ...  The concept of SVOs is introduced and applied to the deterministic fault detection, as the worst-case is considered.  ... 
doi:10.1016/j.automatica.2016.12.011 fatcat:4f2iek7sgndnfhc372zhbizx7u

Analysis of minimal path routing schemes in the presence of faults

Jesse M. Gordon
1992 Discrete Applied Mathematics  
faults.  ...  ., Analysis of minimal path routing schemes in the presence of faults, Discrete Applied Mathematics 37138 (1992) 245-263.  ...  Finally, the comments and suggestions of the anonymous referees helped improve the presentation of this paper.  ... 
doi:10.1016/0166-218x(92)90136-x fatcat:gmcyecripfdorfrm3fmlobyfwi


Kai Lu, Xu Zhou, Xiaoping Wang, Wenzhe Zhang, Gen Li
2013 SIGPLAN notices  
Current deterministic systems generally incur large overhead due to the difficulty of detecting and eliminating data races.  ...  This paper presents RaceFree, a novel multi-threading runtime that adopts a relaxed deterministic model to provide a data-race-free environment for parallel programs.  ...  The basic design of our relaxed deterministic model is to identify necessary communication from unnecessary communication, and cut off all the unnecessary shared-memory communication.  ... 
doi:10.1145/2517327.2442553 fatcat:tkpmgkm5ibahjanupd7copeqby

Fault Displacement Hazard Analysis Workshop in Menlo Park (USGS, California) - 8-9/12/2016 - Synthesis and Perspectives

Stéphane Baize, Oona Scotti
2017 Zenodo  
The primary objective of FDHA is to quantify the spatial distribution and amplitude of surface displacements and deformation caused by tectonic faulting.  ...  Fault Displacement Hazard Analysis (FDHA) plays an important role in the risk assessment and design of both new and existing infrastructures located across and near active and potentially active faults  ...  -The US community is currently elaborating a project (so-called Fault Displacement Hazard Initiative) which aims at Developing Database, Models, and Engineering Implementation Guidelines.  ... 
doi:10.5281/zenodo.1041821 fatcat:a6narttkmbdszkwrzhctyldryy

Performance Evaluation of Adaptive Routing Algorithms for achieving Fault Tolerance in NoC Fabrics

Haibo Zhu, Partha Pratim Pande, Cristian Grecu
2007 2007 IEEE International Conf. on Application-specific Systems, Architectures and Processors (ASAP)  
Related work With technology scaling, fault tolerance of the communication infrastructure is becoming a key challenge for designing NoCs.  ...  Though NoC research has gained significant momentum, the aspect of fault tolerance is not addressed adequately.  ...  Therefore, achieving on-chip fault tolerant communication is becoming increasingly important in presence of such permanent faults.  ... 
doi:10.1109/asap.2007.4429956 dblp:conf/asap/ZhuPG07 fatcat:adxerjtcvzdghgbljamnzuy22a

Recent Advances in the Theory of Checking Experiments with State-oriented Models

Alexandre PETRENKO
2016 DEStech Transactions on Environment Energy and Earth Science  
We consider the problem of model-based testing of reactive systems with state-oriented models, such as finite state machines and transition systems, both distinguishing inputs and outputs.  ...  This problem has its roots in the theory of checking experiments for finite state machines. It continues to attract a lot of attention of research community.  ...  Acknowledgement This research is supported in part by the NSERC of Canada and by the MEIE of Gouvernement du Québec.  ... 
doi:10.12783/dteees/seeie2016/4551 fatcat:lfwo5rrrtzeypheatqtfg4oqke

Fully Scalable Fault-Tolerant Simulations for BSP and CGM

Sung-Ryul Kim, Kunsoo Park
2000 Journal of Parallel and Distributed Computing  
The faults are deterministic (i.e., worst-case distributions of faults are considered) and static (i.e., they do not change in the course of computation).  ...  Ç´ÐÓ Ôµ) slowdown per communication round, provided that a deterministic preprocessing is done that requires Ç´´ÐÓ Ôµ ¾ µ communication rounds and linear (in ) computation per processor in each communication  ...  [2] developed deterministic PRAM simulations under the model of restartable failures.  ... 
doi:10.1006/jpdc.2000.1659 fatcat:2qjyvmcgxba5rooaslwywg56ue

An Enhanced Fault-Tolerant Routing Algorithm for Mesh Network-on-Chip

Arshin Rezazadeh, Mahmood Fathy, Gholamali Rahnavard
2009 2009 International Conference on Embedded Software and Systems  
One of the integral stages of designing Network-on-Chips (NoCs) is the development of an efficient communication system in order to provide low latency networks.  ...  We have proposed a new fault-tolerant routing algorithm based on f-cube3 as a solution to reduce the delay of network packets which uses less number of VCs in comparison with f-cube3.  ...  ACKNOWLEDGMENT This research was supported in part by Shahid Chamran University of Ahvaz grant 2009. We would like to thank Dr. Hamid Sarbazi-Azad for his interesting consultations.  ... 
doi:10.1109/icess.2009.89 dblp:conf/icess/RezazadehFR09 fatcat:5slatayvfvbt7akroxro67kgqq
« Previous Showing results 1 — 15 out of 39,778 results