Sciweavers

4747 search results - page 671 / 950
» Shuffle Memory System
Sort
View
ICC
2007
IEEE
16 years 1 months ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
Richard M. Todd, J. R. Cruz
ISCAS
2007
IEEE
133views Hardware» more  ISCAS 2007»
16 years 29 days ago
Design of a Massively Parallel Vision Processor based on Multi-SIMD Architecture
— Increasing demands for robust image recognition systems require vision processors not only with enormous computational capacities but also with sufficient flexibility to hand...
Kota Yamaguchi, Yoshihiro Watanabe, Takashi Komuro...
KBSE
2007
IEEE
16 years 29 days ago
Model checking concurrent linux device drivers
toolkit demonstrates that predicate abstraction enables automated verification of real world Windows device Our predicate abstraction-based tool DDVerify enables the automated ve...
Thomas Witkowski, Nicolas Blanc, Daniel Kroening, ...
CC
2007
Springer
139views System Software» more  CC 2007»
16 years 26 days ago
Using Prefetching to Improve Reference-Counting Garbage Collectors
Reference counting is a classical garbage collection method. Recently, a series of papers have extended the basic method to drastically reduce its notorious overhead and extend the...
Harel Paz, Erez Petrank
LCPC
2007
Springer
16 years 25 days ago
Revisiting SIMD Programming
Massively parallel SIMD array architectures are making their way into embedded processors. In these architectures, a number of identical processing elements having small private st...
Anton Lokhmotov, Benedict R. Gaster, Alan Mycroft,...