A Data-Parallel Algorithm for Minimum-Width Tree Layout

The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when drawn on a piece of paper, appeals to human understanding. The tree-layout problem, which seems inherently sequential at the first glance, can be solved with a data-parallel algorithm. It takes O (height * log width ) time on width processors when proper communication links between processors are available, where height and width are the height and width of the tree, respectively. The layout calculated by the algorithm has the minimum width. Key Words: data-parallel algorithms, EREW, PRAM, tree layout ####################################################################################### 1. Introduction Traditional parallel algorithms are mostly applied in numerical computation, in which arrays are the most common data structure. Many new parallel algorithms have been discovered that are applicable to more flexible data structures. Furthermore, many problems that seem inherently sequential..