Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

A NEW PARALLEL ALGORITHM FOR ROOTING A TREE

  • Kim, Tae-Nam (Department of Computer Engineering Kumoh National University of Technology) ;
  • Oh, Duk-Hwan (Department of Computer Engineering Kumoh National University of Technology) ;
  • Lim, Eun-Ki (Department of Computer Engineering Kumoh National University of Technology)
  • Published : 1998.06.01

⟨ Previous Next ⟩

Abstract

When an undirected tree T and a vertex ${\gamma}$ in the tree are given the problem to transform T into a rooted tree with ${\gamma}$ as its root is considered. Using Euler tour and prefix sum an optimal algorithm has been developed [2,3]. We will present another parallel algorithm which is optimal also on EREW PRAM. Our approach resuces the given tree step by step by pruning and pointer jumping. That is the tree structure is retained during algorithm processing such that than other tree computations can be carried out in parallel.

Keywords

References

  1. SIAM J. Computing v.17 no.1 Apprximate parallel sheduling, Part 1: The basic technique with applications to optimal parallel list ranking in logarithmic time R.Cole;U.Vishkin
  2. An introduction to parallel algorithms J.JaJa
  3. SIAM J. Computing v.14 no.4 Finding biconnected components and computing tree functions in logarithmic parallel time R.E.Tarjan;U.Vishkin
  4. Ph D thesis, Computer Science Department, Conell University The complexity of parrel computations J.C.Wyllie