Parallel Algorithms for Dandelion-Like Codes

Authors:
Saverio Caminiti;Rossella Petreschi
Affiliations:
Computer Science Department, Sapienza University of Rome, Rome, Italy I00198;Computer Science Department, Sapienza University of Rome, Rome, Italy I00198
Venue:
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Year:
2009

Citing 8
Cited 2

Bijections for Cayley trees, spanning trees, and their q-analogues

Journal of Combinatorial Theory Series A
Tree codes that preserve increases and degree sequences

Discrete Mathematics
An introduction to parallel algorithms

An introduction to parallel algorithms
Full fault dictionary storage based on labeled tree encoding

VTS '96 Proceedings of the 14th IEEE VLSI Test Symposium
PRAM-on-chip: first commitment to silicon

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
On coding labeled trees

Theoretical Computer Science
String coding of trees with locality and heritability

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Distributed maintenance of a spanning tree using labeled tree encoding

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing

Unified parallel encoding and decoding algorithms for Dandelion-like codes

Journal of Parallel and Distributed Computing
Parallel algorithms for encoding and decoding blob code

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the class of Dandelion-like codes, i.e., a class of bijective codes for coding labeled trees by means of strings of node labels. In the literature it is possible to find optimal sequential algorithms for codes belonging to this class, but, for the best of our knowledge, no parallel algorithm is reported. In this paper we present the first encoding and decoding parallel algorithms for Dandelion-like codes. Namely, we design a unique encoding algorithm and a unique decoding algorithm that, properly parametrized, can be used for all Dandelion-like codes. These algorithms are optimal in the sequential setting. The encoding algorithm implementation on an EREW PRAM is optimal, while the efficient implementation of the decoding algorithm requires concurrent reading.