The Research on Parallel Algorithm of A-order in Binary Tree Based on PRAM Model

Author

Yuqiang, Sun ; Yuwan, Gu ; Bing, Su ; Xiaolong, Wang

Author_Institution

Sch. of Inf. Sci. & Eng., Jiangsu Polytech. Univ., Changzhou

Volume

3

fYear

2009

fDate

7-8 March 2009

Firstpage

349

Lastpage

353

Abstract

In this paper, the problem of A-order of binary tree is studied with the PRAM(Parallel Random Access Machine) model of parallel computation and a parallel algorithm for A-order of binary tree is proposed. The process of the parallel algorithm is proceed with detailed description and verified analysis with an application instance. The parallel algorithm of A-order of binary tree provides using and reference for applying it to binary tree traverse sequence and solving the parallelism problem of application program.

Keywords

computational complexity; parallel algorithms; parallel machines; random-access storage; tree data structures; A-order sequence; PRAM model; application instance analysis; binary tree; parallel algorithm; parallel random access machine; time complexity; Algorithm design and analysis; Binary trees; Computational modeling; Computer science; Computer science education; Concurrent computing; Educational technology; Parallel algorithms; Phase change random access memory; Sun; A-order Sequence; Binary Tree; PRAM Model; Parallel Algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Education Technology and Computer Science, 2009. ETCS '09. First International Workshop on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-1-4244-3581-4

Type

conf

DOI

10.1109/ETCS.2009.605

Filename

4959326