Abstract
We consider the problem of designing optimal and efficient algorithms for solving tridiagonal linear systems on a mesh interconnection network. We derive precise upper and lower bounds for these solvers using odd-even cyclic reduction. We present various important lower bounds on execution time for solving these systems including general lower bounds which are independent of initial data assignment, lower bounds based on classifications of initial data assignments which classify assignments via the proportion of initial data assigned amongst processors, and lower bounds for commonly-used data layouts for tridiagonal solvers. Finally, algorithms are provided which have running times not only within a small constant factor of the lower bounds provided but which are within a small constant additive term of the lower bounds.
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.
