Abstract
This paper deals with the performance evaluation of an organizational model for parallel graph reduction, based on the de Bruijn interconnection scheme. For this machine, two scheduling policies, one of which is a static mechanism, and the other, a dynamic one based on the concept of diffusion scheduling, are considered. It is shown through simulations that the simple static scheduling policy does reasonably well and the performance cannot be significantly improved by the dynamic policy which is more complex and incurs higher overheads.
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.
