Abstract
SummaryThis work presents a resource allocation algorithm that considers the characteristics of regular applications to choose the subset of processors, accelerators, and networks that minimize their parallel execution time in a small heterogeneous cluster environment. The resource allocation algorithm uses Heterogeneous Cluster Model (HCM) to estimate the execution time of the parallel applications. The experimental results have shown that, for applications with distinct behaviors, the resource allocation algorithm has successfully chosen the set of resources that minimizes their execution time.
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 callMore From: Concurrency and Computation: Practice and Experience
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.
