Sciweavers

613 search results - page 42 / 123
» The Memory Fragmentation Problem: Solved
Sort
View
PLDI
2010
ACM
15 years 7 months ago
Z-rays: divide arrays and conquer speed and flexibility
Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is pro...
Jennifer B. Sartor, Stephen M. Blackburn, Daniel F...
127
Voted
HPCA
2006
IEEE
16 years 3 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
15 years 7 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
128
Voted
RECOMB
2010
Springer
15 years 1 months ago
Scaffold Filling under the Breakpoint Distance
Motivated by the trend of genome sequencing without completing the sequence of the whole genomes, Mu˜noz et al. recently studied the problem of filling an incomplete multichromos...
Haitao Jiang, Chunfang Zheng, David Sankoff, Binha...
187
Voted
MASCOTS
2010
15 years 4 months ago
PUD-LRU: An Erase-Efficient Write Buffer Management Algorithm for Flash Memory SSD
Flash memory SSDs pose a well-known challenge, that is, the erase-before-write problem. Researchers try to solve this inherent problem from two different angles by either designing...
Jian Hu, Hong Jiang, Lei Tian, Lei Xu