Parallel algorithms for message decomposition

Journal Article · Mon Jun 01 00:00:00 EDT 1987 · J. Parallel Distrib. Comput.; (United States)

DOI:https://doi.org/10.1016/0743-7315(87)90035-9· OSTI ID:6225077

Teng, S H; Wang, B

The authors consider the deterministic and random parallel complexity (time and processor) of message decoding: an essential problem in communications systems and translation systems. They present an optimal parallel algorithm to decompose prefix-coded messages and uniquely decipherable-coded messages in O(n/P) time, using O(P) processors (for all P:1 less than or equal toPless than or equal ton/log n) deterministically as well as randomly on the weakest version of parallel random access machines in which concurrent read and concurrent write to a cell in the common memory are not allowed. This is done by reducing decoding to parallel finite-state automata simulation and the prefix sums.

• Research Organization: Dept. of Computer Science, Univ. of Southern California, Los Angeles, CA 90089
• OSTI ID: 6225077
• Journal Information: J. Parallel Distrib. Comput.; (United States), Vol. 4:3
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PARALLEL PROCESSING
ALGORITHMS
ARRAY PROCESSORS
DATA PROCESSING
DATA TRANSMISSION SYSTEMS
MEMORY DEVICES
OPTIMIZATION
READOUT SYSTEMS
SUPERCOMPUTERS
TIME DEPENDENCE
COMPUTERS
DIGITAL COMPUTERS
MATHEMATICAL LOGIC
PROCESSING
PROGRAMMING
990210* - Supercomputers- (1987-1989)