Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
