By Topic

Linear algebra algorithms in a heterogeneous cluster of personal computers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
J. Barbosa ; Grupo de Arquitecturas e Sistemas, FEUP-INEB, Porto, Portugal ; J. Tavares ; A. J. Padilha

Cluster computing is presently a major research area, mostly for high performance computing. The work presented refers to the application of cluster computing in a small scale where a virtual machine is composed of a small number of off-the-self-personal computers connected by a low cost network. A methodology to determine the optimal number of processors to be used in a computation is presented as well as the speedup results obtained for the matrix-matrix multiplication and for the symmetric QR algorithm for eigenvector computation which are significant building blocks for applications in the target image processing and analysis domain. The load balancing strategy is also addressed

Published in:

Heterogeneous Computing Workshop, 2000. (HCW 2000) Proceedings. 9th

Date of Conference:

2000