RUI: Systolic Arrays with Sublinear Time Complexity

PI先前开发了一个用于矩阵乘法的立方收缩阵列。现在正在寻找关于这种数组的以下两个问题的答案：它们是否可以与通用处理器一起使用，以创建“矩阵计算机”，就像在“矢量计算机”中使用“矢量处理器”一样？这样的计算机能有效地解决其他各种线性代数问题吗？立方收缩阵列允许矩阵乘法在时间上在矩阵大小上是次线性的。设计寻求进一步的收缩装置，将解决进一步的代数问题，在时间次线性的矩阵大小。这项研究的目的是适应已知的计算问题的并行解决方案，以便在更容易实现的并行计算机上有效地执行。这项研究的意义在于它有望为并行计算的各个方面提供额外的见解。

The PI has previously developed a cubic systolic array for matrix multiplication. Answers are now being sought for the following pair of questions concerning such arrays: Can they be used in conjunction with a general purpose processor to create a "matrix computer" in the same way that a "vector processor" is used in a "vector computer"? Could such a computer be used to efficiently solve various other linear algebra problems? Cubic systolic arrays allow matrix multiplication in time sublinear in the matrix size. Designs are sought for further systolic devices that will solve further algebra problems in time sublinear in the matrix size. This research is directed toward adaptation of known parallel solutions of computational problems for efficient execution on more readily implementable parallel computers. The significance of this research is in the additional insight it is expected to provide into aspects of parallel computation.