By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sun Yuqiang ; Sch. of Inf. Sci. & Eng., Jiangsu Polytech. Univ., Changzhou ; Gu Yuwan ; Su Bing ; Wang Xiaolong

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.

Published in:

Education Technology and Computer Science, 2009. ETCS '09. First International Workshop on  (Volume:3 )

Date of Conference:

7-8 March 2009