![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/5F5EA74E-01A9-439B-91F6-87B1F8F7A975 | ||
| Έτος | 2001 | ||
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | E. Mathioudakis, E. P. Papadopoulou ,Y. G. Saridakis, “BiCGSTAB for collocation systems on distributed memory parallel architectures," In 2001 4th European Conf. on Numerical Math. and Adv. Applications ,pp.957-966.doi:10.1007/978-88-470-2089-4_87 https://doi.org/10.1007/978-88-470-2089-4_87 | ||
| Εμφανίζεται στις Συλλογές |
In this paper, which extends and concludes our work in [3, 4], we deal with the problem of efficiently organizing the computation involved in the bi-conjugate gradient stabilized [5] iterative solution of large linear systems, in order to compute on a distributed memory parallel computer. These linear systems are associated with the discreti zation of elliptic boundary value problems using a collocation finite element method based on Hermite bi-cubic elements. The organization of the computation involved follows the methodology used in [3,4]. That is, having the collocation matrix in its normal 2-cyclic or red-black form for increased scalability, we map the computation involved on an appropriate virtual architecture which, in the sequel, is optimally repartitioned and mapped on to a fixed size architecture. The whole process leads to the development of an efficient and well-structured parallel algorithm. For demonstration purposes the algorithm was realized on a distributed memory Parsytee Cognitive computer CC-2.
Copyright © DIAS 2013
