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
Parallel Algorithms for Dandelion-Like Codes / Caminiti, S; Petreschi, Rossella. - STAMPA. - 5544:(2009), pp. 611-620. (Intervento presentato al convegno International Conference on Computational Science tenutosi a Baton Rouge, Lousiana, Usa nel 25-27 Maggio 2009) [10.1007/978-3-642-01970-8_60].
Parallel Algorithms for Dandelion-Like Codes
PETRESCHI, Rossella
2009
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 readingI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
