Sciweavers

573 search results - page 29 / 115
» Parallel Algorithms for Dandelion-Like Codes
Sort
View
NCA
2008
IEEE
15 years 4 months ago
Flexible Parameterization of XOR based Codes for Distributed Storage
Distributed storage systems apply erasure-tolerant codes to guarantee reliable access to data despite failures of storage resources. While many codes can be mapped to XOR operatio...
Peter Sobe, Kathrin Peter
AIRS
2004
Springer
15 years 3 months ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
PPOPP
2003
ACM
15 years 3 months ago
Factorization with morton-ordered quadtree matrices for memory re-use and parallelism
Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this bloc...
Jeremy D. Frens, David S. Wise
WCRE
2003
IEEE
15 years 3 months ago
Extracting an Explicitly Data-Parallel Representation of Image-Processing Programs
Our research goal is to retarget image processing programs written in sequential languages (e.g., C) to architectures with data-parallel processing capabilities. Image processing ...
Lewis B. Baumstark Jr., Murat Guler, Linda M. Will...
SIGMETRICS
2008
ACM
113views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Layered interval codes for tcam-based classification
Ternary content-addressable memories (TCAMs) are increasingly used for high-speed packet classification. TCAMs compare packet headers against all rules in a classification database...
Anat Bremler-Barr, David Hay, Danny Hendler, Boris...