Discriminating Analysis and Ist Application to Matrix by Vector Multiplication on the Pram

We propose that a new measure of performance be applied in the analysis of PRAM algorithms, called discriminating analysis. Discriminating analysis charges Θ (log M) time for access to a memory of size M. As well, a read is split into two primitives, a request and a receipt, with a receipt completing Ω (log M) time units after the corresponding request is issued. A facility for pipelining of access requests is assumed. A new adaptive and optimal algorithm for matrix by vector multiplication is presented.