DocumentCode
3617352
Title
Numerical Evaluation of Linear Recurrences on High Performance Computers and Clusters of Workstations
Author
P. Stpiczynski
Author_Institution
Maria Curie-Sklodowska University, Lublin, Poland
fYear
2004
fDate
6/26/1905 12:00:00 AM
Firstpage
200
Lastpage
205
Abstract
The aim of this paper is to show that the recently developed algorithm for solving linear recurrence systems on shared-memory parallel computers can be efficiently implemented on high performance message passing parallel and vector computers and clusters of workstations. We analyze the performance of the algorithm using two well known models: BSP and Hockney-Jesshope. Finally, we present the results of experiments performed of a Cray X1 and cluster of 15 personal computers running under Linux.
Keywords
"High performance computing","Workstations","Clustering algorithms","Concurrent computing","Message passing","Vectors","Performance analysis","Algorithm design and analysis","Microcomputers","Linux"
Publisher
ieee
Conference_Titel
Parallel Computing in Electrical Engineering, 2004. PARELEC 2004. International Conference on
Print_ISBN
0-7695-2080-4
Type
conf
DOI
10.1109/PCEE.2004.46
Filename
1376757
Link To Document