The Community for Technology Leaders
Green Image
Issue No. 03 - March (1983 vol. 32)
ISSN: 0018-9340
pp: 307-315
E. Dekel , Program in Computer Science, University of Texas
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.
shared memory model, Complexity, design methodologies, parallel algorithms, scheduling

E. Dekel and S. Sahni, "Binary Trees and Parallel Scheduling Algorithms," in IEEE Transactions on Computers, vol. 32, no. , pp. 307-315, 1983.
93 ms
(Ver 3.3 (11022016))