1170 search results - page 8 / 234 » How Fast Is Too Fast |
SPIN
2009
Springer
14 years 5 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
DEBU
2008
13 years 11 months ago
2008
Increasingly, companies recognize that most of their important information does not exist in relational stores but in documents. For a long time, textual information has been rela...
SIGMETRICS
2008
ACM
13 years 10 months ago
2008
ACM
Per-flow network measurement at Internet backbone links requires the efficient maintanence of large arrays of statistics counters at very high speeds (e.g. 40 Gb/s). The prevailin...
TC
2010
13 years 9 months ago
2010
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...
SIGOPSE
2004
ACM
14 years 4 months ago
2004
ACM
Transactions ensure simple and correct handling of concurrency and failures but are often considered too expensive for use in file systems. This paper argues that performance is ...