Abstract

This paper revisits a former work on a CGM-based parallel algorithm for Optimal Binary Search Tree problem. It was shown that, using Knuth sequential algorithm, this CGM algorithm requires O(p1/2) communication rounds and O(n2/p) local computations per processor. Where n is the size of the problem and p is the number of processors used. However this former algorithm leads to high idleness of processors due to the non-efficient communication protocol used. Here we improve the communication protocol in order to minimize idleness of processors and consequently improve the execution time. The simulation results show that the time of execution can be improved up to 44% when p<= 20.

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 call

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.