4542 search results - page 765 / 909 » Design patterns for data structures |
161
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
158
click to vote
SOSP
2007
ACM
16 years 3 months ago
2007
ACM
We introduce a new reliability infrastructure for file systems called I/O shepherding. I/O shepherding allows a file system developer to craft nuanced reliability policies to de...
171
click to vote
ACSC
2009
IEEE
16 years 1 months ago
2009
IEEE
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
220
click to vote
SEMCO
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper we present an automated support for software model evolution using a formal language constructs. For this, we extended Object Constraint Language (OCL) with actio...
171
click to vote
ACSC
2008
IEEE
16 years 26 days ago
2008
IEEE
Modern computer systems are based on the traditional hierarchical file system model, but typically contain large numbers of files with complex interrelationships. This tradition...