hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.2000.01.01

Complexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks

Eunice E. Santos

Puni tekst: engleski, pdf (207 KB) str. 1-12 preuzimanja: 265* citiraj
APA 6th Edition
Santos, E.E. (2000). Complexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks. Journal of computing and information technology, 8 (1), 1-12. https://doi.org/10.2498/cit.2000.01.01
MLA 8th Edition
Santos, Eunice E.. "Complexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks." Journal of computing and information technology, vol. 8, br. 1, 2000, str. 1-12. https://doi.org/10.2498/cit.2000.01.01. Citirano 01.03.2021.
Chicago 17th Edition
Santos, Eunice E.. "Complexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks." Journal of computing and information technology 8, br. 1 (2000): 1-12. https://doi.org/10.2498/cit.2000.01.01
Harvard
Santos, E.E. (2000). 'Complexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks', Journal of computing and information technology, 8(1), str. 1-12. https://doi.org/10.2498/cit.2000.01.01
Vancouver
Santos EE. Complexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks. Journal of computing and information technology [Internet]. 2000 [pristupljeno 01.03.2021.];8(1):1-12. https://doi.org/10.2498/cit.2000.01.01
IEEE
E.E. Santos, "Complexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks", Journal of computing and information technology, vol.8, br. 1, str. 1-12, 2000. [Online]. https://doi.org/10.2498/cit.2000.01.01

Sažetak
We consider the problem of designing optimal and efficient algorithms for solving tridiagonal linear systems with multiple right-hand side vectors on two-dimensional mesh interconnection networks. We derive asymptotic 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, and lower bounds based on classifications of initial data assignments which classify assignments via the proportion of initial data assigned amongst processors. Finally, different algorithms are designed in order to achieve running times that are within a small constant factor of the lower bounds provided.

Hrčak ID: 44847

URI
https://hrcak.srce.hr/44847

Posjeta: 417 *