Sciweavers

4400 search results - page 866 / 880
» A proposal for parallel self-adjusting computation
Sort
View
ANCS
2010
ACM
13 years 5 months ago
The case for hardware transactional memory in software packet processing
Software packet processing is becoming more important to enable differentiated and rapidly-evolving network services. With increasing numbers of programmable processor and acceler...
Martin Labrecque, J. Gregory Steffan
ICS
2009
Tsinghua U.
14 years 2 months ago
Less reused filter: improving l2 cache performance via filtering less reused lines
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
Lingxiang Xiang, Tianzhou Chen, Qingsong Shi, Wei ...
DAC
2002
ACM
14 years 8 months ago
Design of a high-throughput low-power IS95 Viterbi decoder
The design of high-throughput large-state Viterbi decoders relies on the use of multiple arithmetic units. The global communication channels among these parallel processors often ...
Xun Liu, Marios C. Papaefthymiou
WWW
2008
ACM
14 years 8 months ago
Contextual advertising by combining relevance with click feedback
Contextual advertising supports much of the Web's ecosystem today. User experience and revenue (shared by the site publisher ad the ad network) depend on the relevance of the...
Deepayan Chakrabarti, Deepak Agarwal, Vanja Josifo...
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 7 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt