The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2019
DOI: 10.1016/j.procs.2019.11.138
|View full text |Cite
|
Sign up to set email alerts
|

Square Matrix Multiplication Using CUDA on GP-GU

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…Matrix multiplication is the most time-consuming task when training a large dataset. To minimize computing time and to accelerate the processes during preparation, a parallelized matrix multiplication algorithm has been used [13].…”
mentioning
confidence: 99%
“…Matrix multiplication is the most time-consuming task when training a large dataset. To minimize computing time and to accelerate the processes during preparation, a parallelized matrix multiplication algorithm has been used [13].…”
mentioning
confidence: 99%