The Community for Technology Leaders
Parallel Computing in Electrical Engineering, 2004. International Conference on (2004)
Dresden, Germany
Sept. 7, 2004 to Sept. 10, 2004
ISBN: 0-7695-2080-4
pp: 200-205
Przemyslaw Stpiczynski , Maria Curie-Sklodowska University, Lublin, Poland
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.
INDEX TERMS
null
CITATION
Przemyslaw Stpiczynski, "Numerical Evaluation of Linear Recurrences on High Performance Computers and Clusters of Workstations", Parallel Computing in Electrical Engineering, 2004. International Conference on, vol. 00, no. , pp. 200-205, 2004, doi:10.1109/PCEE.2004.46
79 ms
(Ver 3.3 (11022016))