Associative Computations of Some Mathematical Problems,
Abstract
D. In order to evaluate the effectiveness of such a system, a number of fundamental mathematical problems which are useful for a broad range of applications are studied. These are, among others, fast Fourier transform, partial differential equations, and matrix operations. New and modified algorithms are developed. Inefficient word-sequential loading and processing are minimized and redundant storage is eliminated. The execution times for solving these mathematical problems under various conditions are computed, analyzed, and compared with those required by two other associative organizations. It is shown that with the simplest arithmetic-logic units and bis (bit-slice)-sequential data manipulating capability assumed in the proposed organization, the improvements in system performance and storage requirements are significantly and consistently better than those of existing techniques. (Modified author abstract)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1973
- Accession Number
- AD0768978
Entities
People
- Tse-yun Feng
- Wei-tih Cheng
Organizations
- Syracuse University