An approach to designing modular extensible linear arrays for regular algorithms

檔案

日期

1998-02-01

期刊名稱

IEEE TRANSACTIONS ON COMPUTERS

摘要

The purpose of this paper is to describe a new method to design unidirectional modular extensible linear arrays far regular algorithms. The time complexity of our method is polynomial and depends only on the number of dimensions of the regular algorithm. The designed linear array is asymptotically optimal in space and time.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料