Abstract
This paper proposes a parallel algorithm, called KDOP (K-Dimensional Optimal Parallel algorithm), to solve a general class of recurrence equations efficiently. The KDOP algorithm partitions the computation into a series of subcomputations, each of which is executed in the fashion that all the processors work simultaneously with each one executing an optimal sequential algorithm to solve a subcomputation task. The algorithm solves the equations inO(N/p) steps in EREW PRAM model (Exculsive Read Exclusive Write Parallel Random Access Machine model) usingp≤N1-∈ processors, whereN is the size of the problem, and ∈ is a given constant. This is an optimal algorithm (its speedup isO(p)) in the case ofp≤N1-∈. Such an optimal speedup for this problem was previously achieved only in the case ofp≤N0.5. The algorithm can be implemented on machines with multiple processing elements or pipelined vector machines with parallel memory systems.
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.
