Implementation of data manipulating functions on the staran associative processor
Parallel processing data manipulating functions have been widely discussed in the literature. These functions are used to move data from one processing element to another in a parallel manner. A large subset of these functions (shift, flip, shuffle, spread, replicate, close-up) have been implemented as macros on the STARAN S-1000 Associative Processor. An end off shift was found to require 3W to 8W instruction cycles (W is the field width in bits). Other functions have been implemented requiring log2N (N=string length) end off shift operations. Execution times are minimum when string lengths are a power of two. Data manipulation execution times are typically greater than the time required for an array add instruction but much less than required for an array multiply. Aspects of the STARAN architecture as related to the data manipulating functions are discussed.
KeywordsExecution Time Processing Element Mixed Mode Field Width String Length
Unable to display preview. Download preview PDF.
- T. Feng, "Data Manipulating Functions in Parallel Processors and Their Implementations", IEEE Trans. on Computers, (March 1974), pp. 309–318.Google Scholar
- W.T. Cheng, and T. Feng, "Solving Some Mathematical Problems by Associative Processing", Proceedings of the 1972 Sagamore Computer Conference on RADCAP and Its Applications, (August 1972), pp. 169–206.Google Scholar
- H.S. Stone, "Parallel Processing with the Perfect Shuffle", IEEE Trans. on Computers, (February 1971), pp. 153–161.Google Scholar
- E.P. Stabler, "Mixed Mode Arithmetic for STARAN", Proceedings of the 1974 Sagamore Computer Conference on Parallel Processing (August 1974).Google Scholar
- C.D. DeFiore, A.A. Vito, and L.H. Bauer, "Toward the Development of a Higher Order Language for RADCAP", Proceedings of 1972 Sagamore Computer Conference on RADCAP and Its Applications (August 1972), pp. 11–112.Google Scholar