NDLI: Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system

Content Provider	IEEE Xplore Digital Library
Author	Keqin Li Yi Pan Si Qing Zheng
Copyright Year	1990
Abstract	We present efficient parallel matrix multiplication algorithms for linear arrays with reconfigurable pipelined bus systems (LARPBS). Such systems are able to support a large volume of parallel communication of various patterns in constant time. An LARPBS can also be reconfigured into many independent subsystems and, thus, is able to support parallel implementations of divide-and-conquer computations like Strassen's algorithm. The main contributions of the paper are as follows. We develop five matrix multiplication algorithms with varying degrees of parallelism on the LARPBS computing model; namely, MM/sub 1/, MM/sub 2/, MM/sub 3/, and compound algorithms C/sub 1/(/spl epsiv/)and C/sub 2/(/spl delta/). Algorithm C/sub 1/(/spl epsiv/) has adjustable time complexity in sublinear level. Algorithm C/sub 2/(/spl delta/) implies that it is feasible to achieve sublogarithmic time using /spl sigma/(N/sup 3/) processors for matrix multiplication on a realistic system. Algorithms MM/sub 3/, C/sub 1/(/spl epsiv/), and C/sub 2/(/spl delta/) all have o(/spl Nscr//sup 3/) cost and, hence, are very processor efficient. Algorithms MM/sub 1/, MM/sub 3/, and C/sub 1/(/spl epsiv/) are general-purpose matrix multiplication algorithms, where the array elements are in any ring. Algorithms MM/sub 2/ and C/sub 2/(/spl delta/) are applicable to array elements that are integers of bounded magnitude, or floating-point values of bounded precision and magnitude, or Boolean values. Extension of algorithms MM/sub 2/ and C/sub 2/(/spl delta/) to unbounded integers and reals are also discussed.
Sponsorship	IEEE Computer Society
Starting Page	705
Ending Page	720
Page Count	16
File Size	569669
File Format	PDF
ISSN	10459219
Volume Number	9
Issue Number	8
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-08-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Costs Concurrent computing Optical arrays Parallel algorithms Parallel processing Power engineering and energy Eigenvalues and eigenfunctions Polynomials Graph theory Tree graphs
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computational Theory and Mathematics Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Scalable and Modular Algorithms for Floating-Point Matrix Multiplication on Reconfigurable Computing Systems

Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems

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

Analysis of Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory Systems

Parallel directed graph algorithms on directional processor arrays with reconfigurable bus systems

Parallelism and Array Processing

Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays

An efficient parallel algorithm for the efficient domination problem on distance-hereditary graphs

Fast sorting algorithms on a linear array with a reconfigurable pipelined bus system

Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system

Similar Documents

Scalable and Modular Algorithms for Floating-Point Matrix Multiplication on Reconfigurable Computing Systems

Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems

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

Analysis of Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory Systems

Parallel directed graph algorithms on directional processor arrays with reconfigurable bus systems

Parallelism and Array Processing

Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays

An efficient parallel algorithm for the efficient domination problem on distance-hereditary graphs

Fast sorting algorithms on a linear array with a reconfigurable pipelined bus system

Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system