The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1983 vol.32)
pp: 307-315
E. Dekel , Program in Computer Science, University of Texas
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.
INDEX TERMS
shared memory model, Complexity, design methodologies, parallel algorithms, scheduling
CITATION
E. Dekel, S. Sahni, "Binary Trees and Parallel Scheduling Algorithms", IEEE Transactions on Computers, vol.32, no. 3, pp. 307-315, March 1983, doi:10.1109/TC.1983.1676223
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool