Abstract
We present time-processor optimal randomized algorithms for simulating a shared memory machine (EREW PRAM) on, a distributed memory machine (DMM). The first algorithm simulates each step of an n-processor EREW PRAM on an n-processor DMM with O(log log n/log log log n) delay with high probability. This simulation is work optimal and can be made time-processor optimal. The best previous optimal simulations require O(log log n) delay. We also study reconfigurable DMMs which are a complete network version of the well studied reconfigurable meshes. We show an algorithm that simulates each step of an n-processor EREW PRAM DMM an n-processor reconfigurable DMM with only O(log* n) delay with high probability. We further show how to make this simulation time-processor optimal. >
Sign-in/Register to access full text options 
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.
