Sciweavers

559 search results - page 36 / 112
» Algorithms and Data Structures for External Memory
Sort
View
EUROPAR
2004
Springer
15 years 7 months ago
A Data Management and Communication Layer for Adaptive, Hexahedral FEM
The parallel realization of adaptive finite element methods (FEM) has to deal with several irregular and dynamic algorithmic properties caused by adaptive mesh refinement (AMR). ...
Judith Hippold, Gudula Rünger
139
Voted
IPSN
2007
Springer
15 years 8 months ago
Active sensing platform for wireless structural health monitoring
This paper presents SHiMmer, a wireless platform for sensing and actuation that combines localized processing with energy harvesting to provide long-lived structural health monito...
D. Musiani, K. Lin, Tajana Simunic Rosing
CF
2006
ACM
15 years 8 months ago
Exploiting locality to ameliorate packet queue contention and serialization
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
Sailesh Kumar, John Maschmeyer, Patrick Crowley
119
Voted
ICNP
2009
IEEE
15 years 9 months ago
Scalable IP Lookups using Shape Graphs
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
15 years 3 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix