820 search results - page 21 / 164 » Finding low-utility data structures |
OOPSLA
2004
Springer
14 years 2 months ago
2004
Springer
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
BMCBI
2006
13 years 8 months ago
2006
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
HPCA
2009
IEEE
14 years 9 months ago
2009
IEEE
Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been proposed to prefetch such accesses. Unfortunately, many...
BMCBI
2008
13 years 8 months ago
2008
Background: DNA microarray technology allows for the measurement of genome-wide expression patterns. Within the resultant mass of data lies the problem of analyzing and presenting...