Abstract
Current processor allocation techniques for highly parallel systems are based on centralized front-end based algorithms. As a result, the applied strategies are restricted to static allocation, low parallelism and weak fault tolerance. To lift these restrictions we are investigating a distributed approach to the processor allocation problem in large mesh-connected multicomputers. Ano ncontiguous version of a distributed dynamic processor allocation strategy is proposed and studied in this paper as an alternative for parallel programming models that allow dynamic creation and deletion of tasks. Simulations compare the performance of the proposed dynamic strategy with the static counterpart and also with well-known centralized algorithms in such an environment with growing and shrinking processor demands. We also present the results of experiments on a Siemens hpcLine Primergy Server with 96 nodes that show dynamic allocation is feasible with current technologies.
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.
