Sciweavers

535 search results - page 70 / 107
» The Cache Performance and Optimizations of Blocked Algorithm...
Sort
View
163
Voted
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 5 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
FCT
2009
Springer
15 years 6 months ago
Multiway In-Place Merging
Abstract. We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective le...
Viliam Geffert, Jozef Gajdos
114
Voted
SIGCOMM
2009
ACM
15 years 8 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy
168
Voted
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
16 years 2 months ago
EaseDB: a cache-oblivious in-memory query processor
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
Bingsheng He, Yinan Li, Qiong Luo, Dongqing Yang
135
Voted
PDPTA
2010
14 years 11 months ago
A Novel Computation-to-core Mapping Scheme for Robust Facet Image Modeling on GPUs
Though the GPGPU concept is well-known in image processing, much more work remains to be done to fully exploit GPUs as an alternative computation engine. The difficulty is not refo...
Seung In Park, Yong Cao, Layne T. Watson