Sciweavers

158 search results - page 6 / 32
» Simple Fast Parallel Hashing
Sort
View
PPOPP
2011
ACM
12 years 10 months ago
Time skewing made simple
Time skewing and loop tiling has been known for a long time to be a highly beneficial acceleration technique for nested loops especially on bandwidth hungry multi-core processors...
Robert Strzodka, Mohammed Shaheen, Dawid Pajak
SPIRE
2005
Springer
14 years 29 days ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel
SACRYPT
2007
Springer
151views Cryptology» more  SACRYPT 2007»
14 years 1 months ago
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...
Christophe De Cannière, Florian Mendel, Chr...
PODC
2003
ACM
14 years 22 days ago
Split-ordered lists: lock-free extensible hash tables
We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and find operations ...
Ori Shalev, Nir Shavit
IPPS
2003
IEEE
14 years 23 days ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner