Parallelism Of Numerical Algorithms
Binary trees and parallel scheduling algorithms
Eliezer Dekel1 and Sartaj Sahni1
| (1) |
University of Minnesota, USA |
Abstract
This paper examines the use of binary trees in the design of efficient parallel algorithms. Using binary trees, we develop
efficient algorithms for several scheduling problems. The shared memory model for parallel computation is used. Our success
in using binary trees for parallel computations, indicates that the binary tree is an important and useful design tool for
parallel algorithms.
Keywords and Phrases Parallel algorithms - design methodologies - complexity - scheduling - shared memory model
This research was supported in part by the National Science Foundation under grant MCS80-005856 and in part by the Office
of Naval Research under contract N00014-80-C-0650.
References secured to subscribers.