Cart (Loading....) | Create Account
Close category search window
 

Parallel matrix multiplication on a linear array with a reconfigurable pipelined bus system

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)
Keqin Li ; Dept. of Comput. Sci., State Univ. of New York, New Paltz, NY, USA ; Pan, V.Y.

The known fast sequential algorithms for multiplying two N×N matrices (over an arbitrary ring) have time complexity O(Nα ), where 2<α<3. The current best value of α is less than 2.3755. We show that, for all 1⩽p⩽Nα, multiplying two N×N matrices can be performed on a p-processor linear array with a reconfigurable pipelined bus system (LARPBS) in O(N m/P+(N2/p2α/)log p) time. This is currently the fastest parallelization of the best known sequential matrix multiplication algorithm on a distributed memory parallel system. In particular, for all 1⩽p⩽N2.3755, multiplying two N×N matrices can be performed on a p-processor LARPBS in O(N2.3755/p+(N2)/p0.8419log p) time and linear speedup can be achieved for p as large as O(N2.3755/(log N)6.3262). Furthermore, multiplying two N×N matrices can be performed on an LARPBS with O(Nα) processors in O(log N) time. This compares favorably with the performance on a PRAM

Published in:

Computers, IEEE Transactions on  (Volume:50 ,  Issue: 5 )

Date of Publication:

May 2001

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.