Sciweavers

1945 search results - page 102 / 389
» Speeding up Serpent
Sort
View
DEBU
2010
128views more  DEBU 2010»
14 years 8 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
PPOPP
2012
ACM
13 years 6 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
VEE
2012
ACM
187views Virtualization» more  VEE 2012»
13 years 6 months ago
DDGacc: boosting dynamic DDG-based binary optimizations through specialized hardware support
Dynamic Binary Translators (DBT) and Dynamic Binary Optimization (DBO) by software are used widely for several reasons including performance, design simplification and virtualiza...
Demos Pavlou, Enric Gibert, Fernando Latorre, Anto...
MOBIHOC
2006
ACM
15 years 11 months ago
MLS: : an efficient location service for mobile ad hoc networks
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarch...
Roland Flury, Roger Wattenhofer
IPPS
2007
IEEE
15 years 5 months ago
Fast Failure Detection in a Process Group
Failure detectors represent a very important building block in distributed applications. The speed and the accuracy of the failure detectors is critical to the performance of the ...
Xinjie Li, Monica Brockmeyer