Abstract
This paper presents an efficient coarse grain multicomputer CGM parallel algorithm for the cost of the optimal binary search tree problem OBST problem. In the previous best CGM algorithm for this problem, the size of the local memory of each processor is not bounded. And even, in the worst case, its running time reduces to the one of Knuth's sequential algorithm for the same problem, bringing no gain by parallelising OBST. Our CGM algorithm uses Knuth's sequential algorithm for local computations to perform in time as well as the best previous CGM algorithm. Moreover, each processor can process at most two blocks and thus avoid the severe drawback raised above of the previous work.
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 callMore From: International Journal of High Performance Computing and Networking
Disclaimer: 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.
