Abstract
Current trends in computer architecture show that we are aiming toward more cores and even more so more heterogeneity. As an extensive knowledge of processor's internals cannot be a prerequisite to their programming and for the sake of portability, these systems necessitate the compilation flow to evolve and cope with heterogeneity issues. In this paper, we lay a first step toward a possible solution to this challenge by exploring the results of Single Program Multiple Data (SPMD) type of parallelism with heterogeneous compute kernels and predicting performance of the compilation results so that our tools can guide a compiler to build an optimal partition of task automatically, even on heterogeneous targets. We explore a synchronous execution model and use execution time from application parts to predict the performance of the whole application. We show on experimental results a very good accuracy of our tools to predict real world performance on 3 case studies with current days server processors used as proxy experimental setup for future embedded manycores.
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.
