|
| 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
| ASCII Text | x | ||
| E. Dekel, S. Sahni, "Binary Trees and Parallel Scheduling Algorithms," IEEE Transactions on Computers, vol. 32, no. 3, pp. 307-315, March, 1983. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1983.1676223, author = {E. Dekel and S. Sahni}, title = {Binary Trees and Parallel Scheduling Algorithms}, journal ={IEEE Transactions on Computers}, volume = {32}, number = {3}, issn = {0018-9340}, year = {1983}, pages = {307-315}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1983.1676223}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Binary Trees and Parallel Scheduling Algorithms IS - 3 SN - 0018-9340 SP307 EP315 EPD - 307-315 A1 - E. Dekel, A1 - S. Sahni, PY - 1983 KW - shared memory model KW - Complexity KW - design methodologies KW - parallel algorithms KW - scheduling VL - 32 JA - IEEE Transactions on Computers ER - | |||
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.