29 search results - page 5 / 6 » Reducing misspeculation overhead for module-level speculativ... |
SOSP
2007
ACM
14 years 2 months ago
2007
ACM
We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond...
ISCA
1998
IEEE
13 years 10 months ago
1998
IEEE
Branch prediction has enabled microprocessors to increase instruction level parallelism (ILP) by allowing programs to speculatively execute beyond control boundaries. Although spe...
PDP
2008
IEEE
14 years 4 days ago
2008
IEEE
Scheduling for speculative parallelization is a problem that remained unsolved despite its importance. Simple methods such as Fixed-Size Chunking (FSC) need several ‘dry-runs’...
ASPLOS
2004
ACM
13 years 11 months ago
2004
ACM
This paper introduces a compiler-orchestrated prefetching system as a unified framework geared toward ameliorating the gap between processing speeds and memory access latencies. ...
PPOPP
2010
ACM
14 years 3 months ago
2010
ACM
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...