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...

Full description

Saved in:
Bibliographic Details
Published inPattern recognition Vol. 21; no. 6; pp. 559 - 565
Main Authors Wu, Angela Y., Rosenfeld, Azriel
Format Journal Article
LanguageEnglish
Published Oxford Elsevier Ltd 1988
Elsevier Science
Subjects
Algorithms
Applied sciences
Artificial intelligence
Binary image processing
Bit strings
Computer science; control theory; systems
Exact sciences and technology
Parallel processing
Pattern recognition. Digital image processing. Computational geometry
Run length code
Parallel processing
Binary image processing
Run length code
Algorithms
Bit strings
Multiprocessor
Binary image
Image processing
Coding
Artificial intelligence
Online AccessGet full text

Cover

More Information
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