Abstract
This paper proposes a new parallel algorithm for the maximal elements problem with no constraints. It is proposed for a linear array with reconfigurable pipelined bus system (LARPBS) model and on its latest variant, LARPBS(p) model also. It runs in O(log log n ldr log n) time with O(n) processors. Its significance is that it works for any instance of the problem with no constraint laid in [2].
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.
