- 期刊
- OpenAccess
Comparison among Performance Measures for Parallel Matrix Multiplication Algorithms
並列摘要
In this study we analyze how to make a proper selection for the given matrix-matrix multiplication operation and to decide which is the best suitable algorithm that generates a high throughput with a minimum time, a comparison analysis and a performance evaluation for some algorithms is carried out using the identical performance parameters.
延伸閱讀
- 洪惠萍（2009）。Improvement of Performance Index for Ordinal Classifiers with Asymmetrically Weighted Cost Matrix〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2009.00485
- Deng, S. G., Huang, L. T., Wu, B., & Xiong, L. R. (2013). Parallel Optimization for Data-Intensive Service Composition. 網際網路技術學刊, 14(5), 817-824. https://doi.org/10.6138/JIT.2013.14.5.10
- Hsu, S. N. (2010). Comparison of Algorithms for Copy Number Variation Detection [master's thesis, National Tsing Hua University]. Airiti Library. https://doi.org/10.6843/NTHU.2010.00410
- 陳茄煒（2009）。Performance comparison of variable step-size adaptive filtering algorithms〔碩士論文，元智大學〕。華藝線上圖書館。https://doi.org/10.6838/YZU.2009.00179
- 陳朝勳（2014）。Performance Comparison of Parallelized Association-rule Mining Algorithms〔碩士論文，國立臺中科技大學〕。華藝線上圖書館。https://doi.org/10.6826/NUTC.2014.00027