Close category search window
 

Evaluating the Performance of Basic Linear Algebra Subroutines on a Torus Array Processor

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
$31 $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

2 Author(s)
Zekri, A.S. ; Univ. of Aizu, Aizuwakamatsu ; Sedukhin, S.G.

The basic linear algebra subroutines (BLAS) are standard operations to efficiently solve the linear algebra problems on high performance and parallel systems. In this paper, we study the implementation of some important BLAS operations on a NtimesN torus array processor. We show that the performance of the Level-3 BLAS represented by the nxn matrix multiply-add operation, n>N, approaches the theoretical peak as n increases since the degree of data reusing is high. While the performance of Level-1 and Level-2 BLAS operations is low as a result of low data reusing. Fortunately, many applications are based on intensive use of Level-3 BLAS with small percentage of Level-1 and Level-2 BLAS.

Published in:
Computer and Information Technology, 2007. CIT 2007. 7th IEEE International Conference on

Date of Conference: 16-19 Oct. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.