Algorithm Analysis of Sparse Matrix Multiplication

Matrix is widely used in telecommunication, cryptography, computer science and other field. Especially in wireless sensor network data processing, it is important and necessary to keep data transmitting reliable and resilient. In channel coding and secure communication, matrix is used to realize the...

Full description

Saved in:
Bibliographic Details
Published in:IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C) (Online) pp. 912 - 917
Main Authors: Ren, Hui, Ma, Hongwei, Kang, Jian, Liu, Yang, Wang, Lu, Zheng, Xiaogang
Format: Conference Proceeding
Language:English
Published: IEEE 01.12.2021
Subjects:
ISSN:2693-9371
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Matrix is widely used in telecommunication, cryptography, computer science and other field. Especially in wireless sensor network data processing, it is important and necessary to keep data transmitting reliable and resilient. In channel coding and secure communication, matrix is used to realize the coding of transmission information and source information in the channel, which not only reduces the bit error rate of wireless communication, but also realizes the confidentiality of communication. The development of effective algorithms for matrix calculation has been an interesting subject for several centuries and an expanding research field. For some widely used and special matrices, such as sparse matrix and quasi diagonal matrix, there are specific fast algorithms. This paper briefly describes and explains our design of serial algorithms which implementing the sparse matrix multiplication by parallel programming, and also to provide benchmark results to justify the correctness and performance of our design.
AbstractList Matrix is widely used in telecommunication, cryptography, computer science and other field. Especially in wireless sensor network data processing, it is important and necessary to keep data transmitting reliable and resilient. In channel coding and secure communication, matrix is used to realize the coding of transmission information and source information in the channel, which not only reduces the bit error rate of wireless communication, but also realizes the confidentiality of communication. The development of effective algorithms for matrix calculation has been an interesting subject for several centuries and an expanding research field. For some widely used and special matrices, such as sparse matrix and quasi diagonal matrix, there are specific fast algorithms. This paper briefly describes and explains our design of serial algorithms which implementing the sparse matrix multiplication by parallel programming, and also to provide benchmark results to justify the correctness and performance of our design.
Author Liu, Yang
Ren, Hui
Zheng, Xiaogang
Ma, Hongwei
Wang, Lu
Kang, Jian
Author_xml – sequence: 1
  givenname: Hui
  surname: Ren
  fullname: Ren, Hui
  email: pallasrh@sina.com
  organization: Beijing Institute of Astronautical Systems Engineering
– sequence: 2
  givenname: Hongwei
  surname: Ma
  fullname: Ma, Hongwei
  email: mahongwei1987@yeah.net
  organization: Beijing Institute of Astronautical Systems Engineering
– sequence: 3
  givenname: Jian
  surname: Kang
  fullname: Kang, Jian
  email: kangjian004@163.com
  organization: Beijing Institute of Astronautical Systems Engineering
– sequence: 4
  givenname: Yang
  surname: Liu
  fullname: Liu, Yang
  email: yangliu_npu@163.com
  organization: Beijing Institute of Astronautical Systems Engineering
– sequence: 5
  givenname: Lu
  surname: Wang
  fullname: Wang, Lu
  email: henrywang513@126.com
  organization: Beijing Institute of Astronautical Systems Engineering
– sequence: 6
  givenname: Xiaogang
  surname: Zheng
  fullname: Zheng, Xiaogang
  email: zxg1232004@163.com
  organization: Beijing Institute of Astronautical Systems Engineering
BookMark eNotzMtKw0AUANBRFGxrv0CE_EDivfPOMgStQotouy-TeehImoSZCPbvXejq7M6SXA3j4Am5R6gQoX54e9-XrRDARUWBYgWATF-QJUopuNJMikuyoLJmZc0U3pB1zl8AwChwQLogtOk_xhTnz1PRDKY_55iLMRT7yaTsi52ZU_wpdt_9HKc-WjPHcbgl18H02a__XZHD0-OhfS63r5uXttmWkWtWOtCWd1Ir10nJrOfgOhdk8CiFBSesM8J3mqugAw1MdJZiQCe9rq3QzLMVuftro_f-OKV4Mul8rBVHrYD9At-qR7k
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/QRS-C55045.2021.00138
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1665478365
9781665478366
EISSN 2693-9371
EndPage 917
ExternalDocumentID 9741870
Genre orig-research
GroupedDBID 6IE
6IF
6IL
6IN
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
OCL
RIE
RIL
ID FETCH-LOGICAL-i483-d08c4b687db663ce40dbdf6fe165c0d5cda5eb847f8f2f35bc21f1d6e89c583e3
IEDL.DBID RIE
IngestDate Wed Aug 27 02:35:15 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i483-d08c4b687db663ce40dbdf6fe165c0d5cda5eb847f8f2f35bc21f1d6e89c583e3
PageCount 6
ParticipantIDs ieee_primary_9741870
PublicationCentury 2000
PublicationDate 2021-Dec.
PublicationDateYYYYMMDD 2021-12-01
PublicationDate_xml – month: 12
  year: 2021
  text: 2021-Dec.
PublicationDecade 2020
PublicationTitle IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C) (Online)
PublicationTitleAbbrev QRS-C
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0003204012
Score 1.7779185
Snippet Matrix is widely used in telecommunication, cryptography, computer science and other field. Especially in wireless sensor network data processing, it is...
SourceID ieee
SourceType Publisher
StartPage 912
SubjectTerms Benchmark testing
Bit error rate
Communications technology
Computer network reliability
matrix
multiplication
parallel
Software reliability
sparse
Wireless communication
Wireless sensor networks
Title Algorithm Analysis of Sparse Matrix Multiplication
URI https://ieeexplore.ieee.org/document/9741870
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV29T0MhECe1cXBS0xq_w-Ao7QMePBhNo3GwTbUdujXlOLSJ9jW1Nf758j6sMXFxIwyQAy53v7v7HYRceQ6pjHaMeQMmAhRImLHGMY4iqh7Yma6Iwg_ZYGAmEztskOstFwYRy-Iz7BTDMpfvc9gUobKuLVqtZBGg72SZrrha23iKFPE5clGTdHhiu49PI9aLDniqIgwUvFMm5X59olLakLv9_-1-QNo_ZDw63JqZQ9LARYuIm9fnPOL6lzf63VaE5oGOlhGnIu0Xffc_ab8qFqyjcm0yvrsd9-5Z_f0Bm6dGMp8YSJ02mXfRKwBME-980AG5VpB4BX6m0EXjEkwQQSoHggfuNRoLykiUR6S5yBd4TKgIFmUAEyLeTVXUUScgriW8Aw0usSekVYg7XVYNLqa1pKd_T5-RveI8q5qOc9JcrzZ4QXbhYz1_X12Wt_IFVJyOww
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEG6ImuhJDRjf9uDRhbbbLu3REAlGICgcuBE6nSqJsgTB-PPtPsSYePHW9NBm2k5mvpn5poRcOw4yDnYschp0ACjAIm20jTiKoHpgpklBFO42-309HptBhdxsuDCImBefYT0b5rl8l8I6C5U1TNZqpRkA-raSUrCCrbWJqMQiPEguSpoOZ6bx-DSMWsEFlyoAQcHreVru1zcquRVp7_9v_wNS-6Hj0cHG0BySCs6rRNy-PqcB2b-80e_GIjT1dLgISBVpL-u8_0l7RblgGZerkVH7btTqROUHCNFM6jhyTIO0iW46G_wCQMmcdT7xyBMFzClwU4U2mBevvfCxsiC45y5BbUDpGOMjsjVP53hMqPAGYw_aB8QrVdBSKyCsJZyFBCwzJ6SaiTtZFC0uJqWkp39PX5HdzqjXnXTv-w9nZC8726LC45xsrZZrvCA78LGavS8v8xv6AvNpkgo
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=IEEE+International+Conference+on+Software+Quality%2C+Reliability+and+Security+Companion+%28QRS-C%29+%28Online%29&rft.atitle=Algorithm+Analysis+of+Sparse+Matrix+Multiplication&rft.au=Ren%2C+Hui&rft.au=Ma%2C+Hongwei&rft.au=Kang%2C+Jian&rft.au=Liu%2C+Yang&rft.date=2021-12-01&rft.pub=IEEE&rft.eissn=2693-9371&rft.spage=912&rft.epage=917&rft_id=info:doi/10.1109%2FQRS-C55045.2021.00138&rft.externalDocID=9741870