Abstract
Parallel Algorithms that manipulate multi-dimensional arrays on two-dimensional SIMD processor arrays are described here. The definition of these algorithms, which will be called COMPRESS and EXPAND is taken from APL and FORTRAN 8X. These algorithms have already been studied under the constraint that the number of elements is equal to the number processing elements. In the algorithms presented here these restrictions are lifted. Therefore the application of these algorithms contributes to transforming array languages into more general use languages.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
