Sciweavers

370 search results - page 3 / 74
» The perfectly synchronized round-based model of distributed ...
Sort
View
ASIACRYPT
2007
Springer
13 years 11 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
SRDS
2003
IEEE
14 years 18 days ago
Distributed Programming for Dummies: A Shifting Transformation Technique
The perfectly synchronized round model provides the abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We p...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
EDCC
2010
Springer
14 years 4 days ago
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
François Bonnet, Michel Raynal
DEXA
2005
Springer
77views Database» more  DEXA 2005»
14 years 26 days ago
An Optimal Skew-insensitive Join and Multi-join Algorithm for Distributed Architectures
Abstract. The development of scalable parallel database systems requires the design of efficient algorithms for the join operation which is the most frequent and expensive operatio...
Mostafa Bamha
TC
1998
13 years 7 months ago
A Prioritized Petri Net Model and Its Application in Distributed Multimedia Systems
—The achievement of media synchronization has been dealt with in the Object Composition Petri Net (OCPN) model and the extended OCPN (XOCPN) model. Yet these two models are not e...
Sheng Uei Guan, Hsiao-Yeh Yu, Jen-Shun Yang