Sciweavers

3202 search results - page 576 / 641
» Memory access scheduling
Sort
View
CN
2007
97views more  CN 2007»
13 years 7 months ago
A longest prefix first search tree for IP lookup
- One of the key design issues for IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a lon...
Lih-Chyau Wuu, Tzong-Jye Liu, Kuo-Ming Chen
JACM
2006
98views more  JACM 2006»
13 years 7 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
ENTCS
2007
174views more  ENTCS 2007»
13 years 7 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix
JPDC
2006
89views more  JPDC 2006»
13 years 7 months ago
A light-weight, collaborative temporary file system for clustered Web servers
Previous studies indicate that I/O could become a performance bottleneck in commodity PC-based cluster Web servers. Current local native file systems do not work well for expensiv...
Jun Wang
CAL
2002
13 years 7 months ago
Page-Level Behavior of Cache Contention
Cache misses in small, limited-associativity primary caches very often replace live cache blocks, given the dominance of capacity and conflict misses. Towards motivating novel cach...
Siddhartha V. Tambat, Sriram Vajapeyam