Sciweavers

1024 search results - page 180 / 205
» Fault Tolerance in Decentralized Systems
Sort
View
78
Voted
LCN
2008
IEEE
15 years 4 months ago
Constructing low-latency overlay networks: Tree vs. mesh algorithms
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
EDOC
2007
IEEE
15 years 4 months ago
Modeling and Integrating Aspects into Component Architectures
Dependable software systems are difficult to develop because developers must understand and address several interdependent and pervasive dependability concerns. Features that addr...
Lydia Michotte, Robert B. France, Franck Fleurey
NOCS
2007
IEEE
15 years 4 months ago
Towards Open Network-on-Chip Benchmarks
Measuring and comparing performance, cost, and other features of advanced communication architectures for complex multi core/multiprocessor systems on chip is a significant challe...
Cristian Grecu, André Ivanov, Partha Pratim...
SAC
2006
ACM
15 years 3 months ago
Adaptive page-level incremental checkpointing based on expected recovery time
Incremental checkpointing, which is intended to minimize checkpointing overhead, saves only the modified pages of a process. This means that in incremental checkpointing, the time...
Sangho Yi, Junyoung Heo, Yookun Cho, Jiman Hong
PDCAT
2005
Springer
15 years 3 months ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Jun Wang, Min Song