|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Derivation of a parallel algorithm for balancing binary trees
March 1986 (vol. 12 no. 3)
pp. 442-449
| ASCII Text | x | ||
| Abha Moitra, S. Sitharama Iyengar, "Derivation of a parallel algorithm for balancing binary trees," IEEE Transactions on Software Engineering, vol. 12, no. 3, pp. 442-449, March, 1986. | |||
| BibTex | x | ||
| @article{ 10.1109/TSE.1986.6312885, author = {Abha Moitra and S. Sitharama Iyengar}, title = {Derivation of a parallel algorithm for balancing binary trees}, journal ={IEEE Transactions on Software Engineering}, volume = {12}, number = {3}, issn = {0098-5589}, year = {1986}, pages = {442-449}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.1986.6312885}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - Derivation of a parallel algorithm for balancing binary trees IS - 3 SN - 0098-5589 SP442 EP449 EPD - 442-449 A1 - Abha Moitra, A1 - S. Sitharama Iyengar, PY - 1986 KW - Binary search trees KW - Parallel algorithms KW - Program processors KW - Arrays KW - Indexes KW - Vegetation KW - stepwise refinement KW - Balancing parallel algorithms KW - program transformation KW - search trees VL - 12 JA - IEEE Transactions on Software Engineering ER - | |||
A recent trend in program methodologies is to derive efficient parallel programs from sequential programs. This paper explores the question of transforming a sequential algorithm into an efficient parallel algorithm by considering the problem of balancing binary search trees. The derivation of the parallel algorithm makes use of stepwise refinement. We first derive a new iterative balancing algorithm that exploits the similarity of point restructuring required at all the nodes at the same level. From this we derive a parallel algorithm that has time complexity O(1) on an N-processor configuration. This achieves the theoretical limit of speedup possible in a multiprocessor configuration.
Index Terms:
Binary search trees,Parallel algorithms,Program processors,Arrays,Indexes,Vegetation,stepwise refinement,Balancing parallel algorithms,program transformation,search trees
Citation:
Abha Moitra, S. Sitharama Iyengar, "Derivation of a parallel algorithm for balancing binary trees," IEEE Transactions on Software Engineering, vol. 12, no. 3, pp. 442-449, March 1986, doi:10.1109/TSE.1986.6312885
Usage of this product signifies your acceptance of the Terms of Use.