Abstract

In this paper, by means of an abstract model of the SIMD type with vertical data processing (the STAR{machine), we present basic associative parallel algorithms. These algorithms are represented as the corresponding procedures for the STAR{machine, whose correctness is justified and the time complexity is evaluated. We also propose a new version of the language STAR.

File
Issue
Pages
63-77