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...
Uloženo v:
| Vydáno v: | IEEE transactions on parallel and distributed systems Ročník 10; číslo 8; s. 852 - 863 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
01.08.1999
|
| ISSN: | 1045-9219 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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 |
|---|---|
| Bibliografie: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1045-9219 |
| DOI: | 10.1109/71.790602 |