This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Binary Trees and Parallel Scheduling Algorithms
March 1983 (vol. 32 no. 3)
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.
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
Usage of this product signifies your acceptance of the Terms of Use.