Parallel algorithms for encoding and decoding blob code

Authors:
Saverio Caminiti;Rossella Petreschi
Affiliations:
Computer Science Department, Sapienza University of Rome, Rome, Italy;Computer Science Department, Sapienza University of Rome, Rome, Italy
Venue:
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Year:
2010

Citing 16
Cited 1

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
An introduction to genetic algorithms

An introduction to genetic algorithms
The Parallel Evaluation of General Arithmetic Expressions

Journal of the ACM (JACM)
Parallel Prefix Computation

Journal of the ACM (JACM)
Computing Prüfer codes efficiently in parallel

Discrete Applied Mathematics
Synthesis of Parallel Algorithms

Synthesis of Parallel Algorithms
Full fault dictionary storage based on labeled tree encoding

VTS '96 Proceedings of the 14th IEEE VLSI Test Symposium
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
PRAM-on-chip: first commitment to silicon

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Some novel locality results for the blob code spanning tree representation

Proceedings of the 9th annual conference on Genetic and evolutionary computation
On coding labeled trees

Theoretical Computer Science
Parallel Algorithms for Dandelion-Like Codes

ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A bijective code is a method for associating labeled n-trees to (n−2)-strings of node labels in such a way that different trees yield different strings and vice versa. For all known bijective codes, optimal sequential encoding and decoding algorithms are presented in literature, while parallel algorithms are investigated only for some of these codes. In this paper we focus our attention on the Blob code: a code particularly considered in the field of Genetic Algorithms. To the best of our knowledge, here we present the first parallel encoding and decoding algorithms for this code. The encoding algorithm implementation is optimal on an EREW PRAM, while the decoding algorithm requires O(logn) time and O(n) processors on CREW PRAM.