Abstract
This paper introduces a constrained reconfigurable mesh model which incorporates practical assumptions about propagation delays on large sized buses. Simulations ofAT2optimal reconfigurable mesh algorithms on the constrained reconfigurable mesh model are found to be nonoptimal. Optimal solutions for the sorting and convex hull problems that require less area are then presented. For the problems investigated, the constrained reconfigurable mesh model predicts a continuum in performance between the reconfigurable mesh and mesh of processors architectures.
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.
