Abstract
In this paper we present a simulation of an acyclic n×n DR-Mesh on an n×n LR-Mesh. The simulation is efficient in regards to size since both models use the same number of processors. The worst execution time for this simulation is O(n2) time, but we demonstrate that its average execution time is O( log n). The fastest existing simulation takes O( log n) time, but it uses an extremely large number of processors. On the other hand, the most efficient simulation in terms of size takes O( log 2n) time with O(n4/ log 2n) processors. Both of the existing simulations are for the unrestricted DR-Mesh. This paper provides an important step towards efficiently simulating the unrestricted DR-Mesh on weaker models such as the R-Mesh and the LR-Mesh.
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 callMore From: International Journal of Foundations of Computer Science
Disclaimer: 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.
