An efficient implementation for the BROADCAST instruction of BSR (+)
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 exp...
Saved in:
| Published in: | IEEE transactions on parallel and distributed systems Vol. 10; no. 8; pp. 852 - 863 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.08.1999
|
| ISSN: | 1045-9219 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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( ). Thus, BSR or BSR with k criteria (k > 1) is BSR( ) in a special case. An efficient implementation for the Broadcast Instruction of BSR( ) is proposed, requiring (1/k)th of the circuits used by the best previous implementation of BSR with k criteria. Of all PRAMs, BSR( ) is the most powerful in computation |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1045-9219 |
| DOI: | 10.1109/71.790602 |