Sciweavers

601 search results - page 39 / 121
» Lattice-based memory allocation
Sort
View
CCR
2004
153views more  CCR 2004»
13 years 7 months ago
Tree bitmap: hardware/software IP lookups with incremental updates
IP address lookup is challenging for high performance routers because it requires a longest matching prefix at speeds of up to 10 Gbps (OC-192). Existing solutions have poor updat...
Will Eatherton, George Varghese, Zubin Dittia
OOPSLA
2004
Springer
14 years 1 months ago
Finding your cronies: static analysis for dynamic object colocation
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
Samuel Z. Guyer, Kathryn S. McKinley
SIGCOMM
2012
ACM
11 years 10 months ago
FairCloud: sharing the network in cloud computing
e network, similar to CPU and memory, is a critical and shared resource in the cloud. However, unlike other resources, it is neither shared proportionally to payment, nor do cl...
Lucian Popa 0002, Gautam Kumar, Mosharaf Chowdhury...
WOSP
2010
ACM
14 years 2 months ago
Reducing performance non-determinism via cache-aware page allocation strategies
Performance non-determinism in computer systems complicates evaluation, use, and even development of these systems. In performance evaluation via benchmarking and simulation, nond...
Michal Hocko, Tomás Kalibera
PVM
2009
Springer
14 years 2 months ago
MPC-MPI: An MPI Implementation Reducing the Overall Memory Consumption
Message-Passing Interface (MPI) has become a standard for parallel applications in high-performance computing. Within a single cluster node, MPI implementations benefit from the s...
Marc Pérache, Patrick Carribault, Herv&eacu...