An efficient implementation for the BROADCAST instruction of BSR/sup +/

BSR (Broadcasting with Selective Reduction) is a PRAM more powerful than any CRCW PRAM. In order to extend the Broadcast Instruction of BSR and make it more useful for a large class of applications, this article permits it to use a general form of selection, specifically, an arbitrary relational expression. BSR with general selection is denoted by BSR/sup +/. Thus, BSR or BSR with k criteria (k>1) is BSR/sup +/ in a special case. An efficient implementation for the Broadcast Instruction of BSR/sup +/ is proposed, requiring (1/k)th of the circuits used by the best previous implementation of BSR with k criteria. Of all PRAMs, BSR/sup +/ is the most powerful in computation.