Abstract
We show that PRAMs that have multiprefix (scan) operations available as primitives may be simulated by unbounded fanin circuits with gates for related operations. The complexity bounds depend on the word-size of the PRAM but not on the multiprefix operations or the instruction set of the processors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
