Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/17251
Title: | Intel vs AMD: Matrix Multiplication Performance | Authors: | Anchev, Nenad Gushev, Marjan Ristov, Sashko Atanasovski, Blagoj |
Keywords: | HPC, CPU, Cache, Memory, Superlinear Speedup | Issue Date: | 20-May-2013 | Publisher: | IEEE | Conference: | 2013 36th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO) | Abstract: | Matrix-Matrix multiplication (MMM) is widely used algorithm in today’s computations and researches. Many techniques exist to speed up its execution. In this paper, we analyze the performance of MMM varying matrix size in order to determine its behavior and the region where it provides the best performance. We also determine the best speedup and efficiency in parallel implementation for different CPU architectures since cache architecture and organization is very important for MMM performance. Intel i7 and AMD Opteron CPUs are used as an environment. Several achieved results are expected, but there are also many unexpected. Superlinear speedup (speedup greater than the number of used threads) and the efficiency greater than 100% are achieved for each parallel implementation only on AMD Opteron. We observe regions with performance discrepancy for all three parameters for both CPUs. | URI: | http://hdl.handle.net/20.500.12188/17251 |
Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Maximum_Performance_for_Matrix-Matrix_Multiplication_V0.7.pdf | 328.88 kB | Adobe PDF | View/Open |
Page view(s)
39
checked on Jul 24, 2024
Download(s)
71
checked on Jul 24, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.