In fact, most parallel algorithms for finding MST (including those CRCW
PRAM algorithms) are based on a similar approach.
In Section 4 we show that each step of a [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] machine can be implemented in O(logp) amortized time with high probability on a p processor hypercube or CRCW PRAM.
In the CRCW (concurrent read concurrent write) PRAM this assumption is made directly in the model, and in the hypercube we assume the network supports combining within the switches to support these concurrent accesses [Ranade 1989].
The Vishay CRCW
series of thick film resistors are ideal for use in automotive and other high power circuits.
Following the nomenclature introduced by Vishkin , the CRCW
(Concunent Read, Concurrent Write) PRAM allows memory access conflicts.
Optimal Bounds for Decision Problems on the CRCW
However, once the off-line embedding is performed for one G, simulation of another G' can be performed on-line by using G to simulate G' For example, by embedding a butterfly or other universal network into H off-line, we can then use H to simulate any CRCW
PRAM algorithm in an on-line fashion with delay O([log.