5523 search results - page 126 / 1105 » Improving application performance with hardware data structu... |
153
click to vote
PC
2011
14 years 5 months ago
2011
In the last decade, cluster computing has become the most popular high-performance computing architecture. Although numerous technological innovations have been proposed to improv...
FPL
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents the design and implementation of BORPH's kernel file system layer that provides FPGA processes direct access to the general file system. Using a semantics...
AES
2007
Springer
14 years 10 months ago
2007
Springer
This paper deals with the numerical simulation of flows of stratified fluids through channels with irregular geometry. Channel crosssections are supposed to be symmetric but no...
116
click to vote
ACSC
2007
IEEE
15 years 4 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
112
click to vote
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...