𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel skeletons for manipulating general trees

✍ Scribed by Kiminori Matsuzaki; Zhenjiang Hu; Masato Takeichi

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
675 KB
Volume
32
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel Implementation of Tree Skeleton
Parallel Implementation of Tree Skeletons
✍ D.B. Skillicorn πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 277 KB

Trees are a useful data type, but they are not routinely included in parallel programming systems, in part because their irregular structure makes partitioning and scheduling difficult. We present a method for algebraically constructing implementations of tree skeletons, high-level homomorphic opera

Skeleton extraction for tree models
Skeleton extraction for tree models
✍ Zhixun Su; Yuandi Zhao; Chunjiang Zhao; Xinyu Guo; Zhiyang Li πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 682 KB
Uniform Generation of Binary Trees in Pa
Uniform Generation of Binary Trees in Parallel
✍ M.D. Atkinson; J.R. Sack πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 245 KB

An unbiased random generator for binary trees is developed for a CREW-PRAM. The generator is capable of generating a binary tree on \(n\) nodes in time \(O(\log n)\), space \(O(n)\), with \(O(n)\) processors; it is also capable of generating various related combinatorial objects. O 1994 Academic Pre

Skeleton PIC codes for parallel computer
Skeleton PIC codes for parallel computers
✍ Viktor K. Decyk πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 553 KB

Simple skeleton particle-in-cell codes designed for massively parallel computers are described. These codes are used to develop new algorithms and evaluate new parallel computers. Benchmark results from a number of MIMD parallel computers are presented.