On the effective bandwidth of interleaved memories in vector processor systems
IEEE Transactions on Computers
An extended set of FORTRAN basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
Linear algebra software on IBM and CRAY computers
Journal of Computational and Applied Mathematics
A comparison of parallel processing on CRAY X-MP AND IBM 3090 VF multiprocessors
ICS '89 Proceedings of the 3rd international conference on Supercomputing
Squeezing the most out of an algorithm in CRAY FORTRAN
ACM Transactions on Mathematical Software (TOMS)
Basic Linear Algebra Subprograms for Fortran Usage
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
Communications of the ACM
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
The IBM 3090 system: an overview
IBM Systems Journal
Vector system performance of the IBM 3090
IBM Systems Journal
The impact of memory organization on the performance of matrix multiplication
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
| Hi-index | 0.00 |
The memory organization of vector supercomputers is designed to support a high rate of data transfer between registers and main memory. Nevertheless, there are applications for which this link turns out to be a bottleneck. It can be removed using an interface to appropriate library software or programming techniques which take architectural features into account. This report deals with the impact of memory access conflicts on the execution time of matrix calculations. For this study, two variants of matrix multiplication are considered as model problems contrasting memory access with stride one and access with stride n. The CPU time consumption of the two variants is analyzed by means of simulation. It is shown, that the results are also valid for the solution of linear equations, eigenvalue problems, and shortest-path problems if the algorithms are implemented analogously. The analysis is carried out for computers with an interleaved memory (CRAY X-MP, CRAY Y-MP, FUJITSU VP) and a hierarchical memory (IBM 3090). The results are also related to library software in order to point out the benefits a user may gain from the usage of highly optimized software. Moreover, it is demonstrated that multiple processors working in parallel on a shared memory may even increase the number of memory access conflicts.