Sciweavers

2035 search results - page 265 / 407
» Working memory
Sort
View
KBSE
2005
IEEE
15 years 9 months ago
Locating faulty code using failure-inducing chops
Software debugging is the process of locating and correcting faulty code. Prior techniques to locate faulty code either use program analysis techniques such as backward dynamic pr...
Neelam Gupta, Haifeng He, Xiangyu Zhang, Rajiv Gup...
ISLPED
2005
ACM
102views Hardware» more  ISLPED 2005»
15 years 9 months ago
Snug set-associative caches: reducing leakage power while improving performance
As transistors keep shrinking and on-chip data caches keep growing, static power dissipation due to leakage of caches takes an increasing fraction of total power in processors. Se...
Jia-Jhe Li, Yuan-Shin Hwang
VEE
2005
ACM
218views Virtualization» more  VEE 2005»
15 years 9 months ago
The pauseless GC algorithm
Modern transactional response-time sensitive applications have run into practical limits on the size of garbage collected heaps. The heap can only grow until GC pauses exceed the ...
Cliff Click, Gil Tene, Michael Wolf
EMSOFT
2005
Springer
15 years 9 months ago
Optimizing inter-processor data locality on embedded chip multiprocessors
Recent research in embedded computing indicates that packing multiple processor cores on the same die is an effective way of utilizing the ever-increasing number of transistors. T...
Guilin Chen, Mahmut T. Kandemir
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
15 years 9 months ago
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
Ling Zhuo, Viktor K. Prasanna