Unified parallel encoding and decoding algorithms for Dandelion-like codes

The Dandelion-like codes are eight bijections between labeled trees and strings of node labels. The literature contains optimal sequential algorithms for these bijections, but no parallel algorithms have been reported. In this paper the first parallel encoding and decoding algorithms for Dandelion-l...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of parallel and distributed computing Ročník 70; číslo 11; s. 1119 - 1127
Hlavní autori: Caminiti, Saverio, Petreschi, Rossella
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier Inc 01.11.2010
Elsevier
Predmet:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Bijective tree encoding
Computer networks
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Dandelion-like codes
Decoding
Distributed processing
Encoding
Exact sciences and technology
Labels
Optimization
PRAM algorithms
Prüfer code
Software
Strings
Theoretical computing
Trees
Dandelion-like codes
Bijective tree encoding
Prüfer code
PRAM algorithms
Prfer Number
Parallel algorithm
Optimal algorithm
Character string
Concurrency
Graph theory
Graph labelling
Distributed computing
ISSN:0743-7315, 1096-0848
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The Dandelion-like codes are eight bijections between labeled trees and strings of node labels. The literature contains optimal sequential algorithms for these bijections, but no parallel algorithms have been reported. In this paper the first parallel encoding and decoding algorithms for Dandelion-like codes are presented. Namely, a unique encoding algorithm and a unique decoding algorithm, which when properly parameterized, can be used for all Dandelion-like codes, are designed. 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. ► A unified encoding algorithm for all Dandelion-like codes requiring linear time. ► A unified decoding algorithm for all Dandelion-like codes requiring linear time. ► Efficient parallel implementation of these algorithms on a PRAM.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0743-7315
1096-0848
DOI:10.1016/j.jpdc.2010.07.003