Sciweavers

387 search results - page 13 / 78
» Many Random Walks Are Faster Than One
Sort
View
ISCA
2010
IEEE
214views Hardware» more  ISCA 2010»
13 years 11 months ago
Translation caching: skip, don't walk (the page table)
This paper explores the design space of MMU caches that accelerate virtual-to-physical address translation in processor architectures, such as x86-64, that use a radix tree page t...
Thomas W. Barr, Alan L. Cox, Scott Rixner
ISPDC
2007
IEEE
14 years 3 months ago
Fully Distributed Active and Passive Task Management for Grid Computing
The task management is a key point in grid applications and can highly influence their efficiency. There are many solutions that we can classify according to their centralizatio...
Alain Bui, Olivier Flauzac, Cyril Rabat
CCS
2009
ACM
14 years 3 months ago
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
Prateek Mittal, Nikita Borisov
PVLDB
2008
110views more  PVLDB 2008»
13 years 8 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons
CP
2008
Springer
13 years 10 months ago
Optimization of Simple Tabular Reduction for Table Constraints
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
Christophe Lecoutre