Cost-optimal parallel algorithms for constructing 2-3 trees
Journal Article
·
· Journal of Parallel and Distributed Computing; (United States)
- Dept. of Computer Science and Information Engineering, National Taiwan Univ., Taipei (TW)
In this paper, two cost-optimal parallel algorithms are presented for constructing 2-3 trees from sorted lists of data items. The two parallel algorithms are designed on a shared-memory SIMD computer; one, based on the EREW model, uses N/log log N processors and requires O(log log N) time and the other, based on the CREW model, uses N processors and requires O(1) time, where N is the number of data items in the input sorted list.
- OSTI ID:
- 5001516
- Journal Information:
- Journal of Parallel and Distributed Computing; (United States), Journal Name: Journal of Parallel and Distributed Computing; (United States) Vol. 11:3; ISSN 0743-7315; ISSN JPDCE
- Country of Publication:
- United States
- Language:
- English
Similar Records
Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees
Parallel sorting in a ring network of processors
A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416783
Parallel sorting in a ring network of processors
Journal Article
·
Tue Feb 28 23:00:00 EST 1989
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6243196
A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs
Journal Article
·
Wed Jun 01 00:00:00 EDT 1988
· SIAM J. Comput.; (United States)
·
OSTI ID:6930310