Sciweavers

1785 search results - page 149 / 357
» Modeling Communication with Synchronized Environments
Sort
View
139
Voted
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
16 years 4 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
168
Voted
PARA
2004
Springer
15 years 9 months ago
Parallel Discrete Event Simulations of Grid-Based Models: Asynchronous Electromagnetic Hybrid Code
Abstract. The traditional technique to simulate physical systems modeled by partial differential equations is by means of a time-stepped methodology where the state of the system ...
Homa Karimabadi, Jonathan Driscoll, Jagrut Dave, Y...
146
Voted
HPCC
2007
Springer
15 years 9 months ago
A Data Imputation Model in Sensor Databases
Data missing is a common problem in database query processing, which can cause bias or lead to inefficient analyses, and this problem happens more often in sensor databases. The re...
Nan Jiang
133
Voted
POPL
2009
ACM
15 years 10 months ago
Speculative N-Way barriers
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
Lukasz Ziarek, Suresh Jagannathan, Matthew Fluet, ...
156
Voted
TC
2002
15 years 3 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...