[图书][B] Distributed algorithms for message-passing systems
M Raynal - 2013 - Springer
Distributed Algorithms for Message-Passing Systems Page 1 Michel Raynal Distributed Algorithms
for Message-Passing Systems Page 2 Distributed Algorithms for Message-Passing Systems Page …
for Message-Passing Systems Page 2 Distributed Algorithms for Message-Passing Systems Page …
Semantic feature selection using WordNet
S Chua, N Kulathuramaiyer - IEEE/WIC/ACM International …, 2004 - ieeexplore.ieee.org
The web has caused an explosion of documents, requiring the need for an automated text
categorization system. This paper explores the notion of semantic feature selection by …
categorization system. This paper explores the notion of semantic feature selection by …
The minimal dependency relation for causal event ordering in distributed computing
SEP Hernández - Applied Mathematics & Information Sciences, 2015 - hal.science
Several algorithms of different domains in distributed systems are designed over the
principle of the Happened-Before Relation (HBR). One common as-pect among them is that …
principle of the Happened-Before Relation (HBR). One common as-pect among them is that …
A mechanism for the causal ordered set representation in large-scale distributed systems
H Khlif, HH Kacem, SEP Hernandez… - 2015 IEEE 24th …, 2015 - ieeexplore.ieee.org
Distributed systems have undergone a very fast evolution in the last years. Large-scale
distributed systems have become an integral part of everyday life with the development of …
distributed systems have become an integral part of everyday life with the development of …
[PDF][PDF] MCSR: A graph transformation based approach for Minimal and Compact Set Representation of Causal Dependencies in Distributed Systems.
H Khlif, HH Kacem, SEP Hernández - TACC, 2023 - ceur-ws.org
Causal ordering is an important property in distributed systems. Several algorithms have
been developed over this principle. For example, there are solutions for roll-back recovery …
been developed over this principle. For example, there are solutions for roll-back recovery …
[PDF][PDF] Dependability for ESB systems in critical environments based on checkpointing and self-healing principles
IBM created a new paradigm called Autonomic Computing (AC); where systems are seen as
self-manageable. To attack the problem of intercommunication and heterogeneity the …
self-manageable. To attack the problem of intercommunication and heterogeneity the …
[PDF][PDF] Time Specification, Modeling and Measurement in frame of Cyber-Physical System Applications Design
M Sveda - … Journal of Systems Applications, Engineering & …, 2013 - academia.edu
This paper addresses the role, interpretation and the deployment of the notion “time” in
distributed cyber-physical systems. Stemming from a brief state-of-the-art review, it …
distributed cyber-physical systems. Stemming from a brief state-of-the-art review, it …
A Validation Approach for Quasi-Synchronous Checkpointing Algorithms in HPC Systems
H Khlif, HH Kacem, SP Hernandez… - 2017 IEEE/ACS 14th …, 2017 - ieeexplore.ieee.org
High Performance Computing (HPC) has seen prodigious growth over the past few years
and fault tolerance solutions have been incorporated into HPC systems. The most commonly …
and fault tolerance solutions have been incorporated into HPC systems. The most commonly …
Nature of Distributed Computations and the Concept of a Global State
M Raynal, M Raynal - Distributed Algorithms for Message-Passing …, 2013 - Springer
A sequential execution can be represented by the sequence (trace) of consecutive local
states it has produced, or, given its initial state, by the sequence of statements that have …
states it has produced, or, given its initial state, by the sequence of statements that have …