Parallel processing of encoded bit strings
Many operations on strings of length n can be speeded up by a factor of p using p processors. String operations can also be speeded up, even when a single processor is used, by compactly encoding the strings, e.g. using run length code. This paper shows how to combine these two approaches by using p...
Saved in:
Published in | Pattern recognition Vol. 21; no. 6; pp. 559 - 565 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Oxford
Elsevier Ltd
1988
Elsevier Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Many operations on strings of length n can be speeded up by a factor of
p using
p processors. String operations can also be speeded up, even when a single processor is used, by compactly encoding the strings, e.g. using run length code. This paper shows how to combine these two approaches by using
p processors to process compactly encoded strings. |
---|---|
ISSN: | 0031-3203 1873-5142 |
DOI: | 10.1016/0031-3203(88)90029-5 |