Author:
Amano Hideharu,Yoshida Takaichi,Aiso Hideo
Abstract
In analyzing electronic circuits, it is usually necessary to solve simultaneous linear equations which provide with a sparse coefficient matrix. In order to treat these problems effectively, we propose a dedicated parallel machine called 'Sparse Matrix Solving Machine', or (SM)
2
for short.
(SM)
2
is composed of multiple clusters, each consisting of multiple processing units (PUs) attached to a sophisticated shared memory which enables any PUs to read data from memory simultaneously without conflict. The structure of the cluster is organized so as to make the best use of the neighboring effects involved in the problems.
In this paper, the characteristics of the problems to be solved and the behavior of the PUs will be discussed, and the optimum system configuration for (SM)
2
will be shown and its effectiveness will be justified through behavior analysis and simulations.
Publisher
Association for Computing Machinery (ACM)
Reference8 articles.
1. Iterative Solution of linear equation on a parallel processor system;Conrad Y.;IEEE Transaction on Computer vol,1977
2. Experience Using Multiprocessor Systems—A Status Report
3. The Multiprocessor System SMS201 Combining 128 Microprocessor to a Powerful Computer;Kober R.;Digest of Papers Compcon,1977
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Hardware Solver for Simultaneous Linear Equations with Multistage Interconnection Network;14th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART'24));2024-06-19