170 search results - page 2 / 34 » Amortised Memory Analysis Using the Depth of Data Structures |
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
DDECS
2007
IEEE
13 years 12 months ago
2007
IEEE
—An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. A commonly used repair strategy is to equip memories with sp...
FTTCS
2006
13 years 5 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Device drivers often keep data in multiple data structures simultaneously while embedding list or tree related records into the records containing the actual data; this r...
AADEBUG
1997
Springer
13 years 9 months ago
1997
Springer
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...