![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/86FC7920-4441-49A8-B801-3623D46DCFF6 | ||
| Έτος | 2004 | ||
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | Ε.Ν. Mathioudakis, Ε. Ρ. Papadopoulou ,Υ. G. Saridakis, " Iterative Solution of elliptic collocation systems οn a cognitive parallel computer ", Comp. and Math. with Appl., vol. 48,no.5-6 pp. 951-970, Sept. 2004.doi:10.1016/j.camwa.2003.01.017 https://doi.org/10.1016/j.camwa.2003.01.017 | ||
| Εμφανίζεται στις Συλλογές |
The performance of parallel algorithms implementing the block SOR iterative method, used for the solution of linear systems arising from the discretization of elliptic BVPs by the finite element collocation method, is investigated in this paper. By making use of a recently introduced block tridiagonal partitioning of the collocation matrix, which yields faster rates of convergence, and its associated modified red-black ordering of unknowns and equations, we succeeded to increase the scalability of the problem. The study of the communicational and computational needs of the problem on a virtual parallel machine made possible the mapping of the resulted SOR-algorithm on a fixed size distributed memory parallel system, utilizing a simple pipeline architecture among its processors, in an optimum way. The proposed parallel schemes are being realized on a Parsytec cognitive computer via an SPMD programming model. Speedup measurements are used to reveal the efficiency of our implementation.
Copyright © DIAS 2013
