Sciweavers

313 search results - page 28 / 63
» Computing synchronizer failure probabilities
Sort
View
DSN
2005
IEEE
15 years 5 months ago
A Framework for Node-Level Fault Tolerance in Distributed Real-Time Systems
This paper describes a framework for achieving node-level fault tolerance (NLFT) in distributed realtime systems. The objective of NLFT is to mask errors at the node level in orde...
Joakim Aidemark, Peter Folkesson, Johan Karlsson
IJCAI
2003
15 years 1 months ago
Probabilistically Survivable MASs
Muhiagent systems (MAS) can "go down" for a large number of reasons, ranging from system malfunctions and power failures to malicious attacks. The placement of agents on...
Sarit Kraus, V. S. Subrahmanian, N. Cihan Tas
84
Voted
NCA
2006
IEEE
15 years 5 months ago
An Adaptive Quality of Service Based Scheduling Algorithm for Wide Area Large Scale Problems
This paper explores the problem of dynamically scheduling large scale applications over wide area networks and then proposes an adaptive scheduling algorithm to provide quality of...
Wilson Lozano, Wilson Rivera
PRDC
2007
IEEE
15 years 6 months ago
An Automatic Real-Time Analysis of the Time to Reach Consensus
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
Tatsuhiro Tsuchiya, André Schiper
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
15 years 5 months ago
Association Rule Mining in Peer-to-Peer Systems
We extend the problem of association rule mining – a key data mining problem – to systems in which the database is partitioned among a very large number of computers that are ...
Ran Wolff, Assaf Schuster