Sciweavers

3737 search results - page 201 / 748
» Parallel Distributed Belief Networks
Sort
View
PODC
2006
ACM
15 years 9 months ago
Timeliness, failure-detectors, and consensus performance
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
Idit Keidar, Alexander Shraer
HPDC
1996
IEEE
15 years 7 months ago
Shared Memory NUMA Programming on I-WAY
The performance of the Global Array shared-memory nonuniform memory-access programming model is explored on the I-WAY, wide-area-network distributed supercomputer environment. The...
Jarek Nieplocha, Robert J. Harrison
IPPS
1997
IEEE
15 years 7 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
PODC
1992
ACM
15 years 7 months ago
The Weakest Failure Detector for Solving Consensus
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [199...
Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toue...
163
Voted
ICNS
2006
IEEE
15 years 9 months ago
Building Distributed Access Control System Using Service-Oriented Programming Model
– Service-Oriented Programming Model is a new methodology for building service-oriented applications. In the Service-Oriented Programming Model, an application is assembled from ...
Ivan Zuzak, Sinisa Srbljic, Ivan Benc