loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Parallel Computing in Electrical Engineering, (PARELEC'04)
Numerical Evaluation of Linear Recurrences on High Performance Computers and Clusters of Workstations
Dresden, Germany
September 07-September 10
ISBN: 0-7695-2080-4
Przemyslaw Stpiczynski, Maria Curie-Sklodowska University, Lublin, Poland
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.
Citation:
Przemyslaw Stpiczynski, "Numerical Evaluation of Linear Recurrences on High Performance Computers and Clusters of Workstations," parelec, pp.200-205, International Conference on Parallel Computing in Electrical Engineering, (PARELEC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.