Sciweavers

58 search results - page 9 / 12
» Making Pointer-Based Data Structures Cache Conscious
Sort
View
ICNP
2009
IEEE
14 years 4 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...
FAST
2008
14 years 3 days ago
Avoiding the Disk Bottleneck in the Data Domain Deduplication File System
Disk-based deduplication storage has emerged as the new-generation storage system for enterprise data protection to replace tape libraries. Deduplication removes redundant data se...
Benjamin Zhu, Kai Li, R. Hugo Patterson
ICS
2010
Tsinghua U.
13 years 11 months ago
Timing local streams: improving timeliness in data prefetching
Data prefetching technique is widely used to bridge the growing performance gap between processor and memory. Numerous prefetching techniques have been proposed to exploit data pa...
Huaiyu Zhu, Yong Chen, Xian-He Sun
AISS
2010
146views more  AISS 2010»
13 years 4 months ago
Zatara, the Plug-in-able Eventually Consistent Distributed Database
With the proliferation of the computer Cloud, new software delivery methods were created. In order to build software to fit into one of these models, a scalable, easy to deploy st...
Bogdan Carstoiu, Dorin Carstoiu
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
14 years 2 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo