Combinatorial Optimization of Work Distribution on Heterogeneous Systems
Suejb Memeti, Sabri Pllana

TL;DR
This paper presents a method combining combinatorial optimization and machine learning to efficiently determine optimal work distribution in heterogeneous systems, significantly reducing experimental effort while improving performance.
Contribution
It introduces a novel approach that integrates combinatorial optimization with machine learning to optimize work sharing in heterogeneous systems, reducing the need for exhaustive testing.
Findings
Achieved near-optimal configurations with only 5% of experiments
Reduced overall application execution time
Validated on a platform with Intel Xeon CPUs and Xeon Phi co-processor
Abstract
We describe an approach that uses combinatorial optimization and machine learning to share the work between the host and device of heterogeneous computing systems such that the overall application execution time is minimized. We propose to use combinatorial optimization to search for the optimal system configuration in the given parameter space (such as, the number of threads, thread affinity, work distribution for the host and device). For each system configuration that is suggested by combinatorial optimization, we use machine learning for evaluation of the system performance. We evaluate our approach experimentally using a heterogeneous platform that comprises two 12-core Intel Xeon E5 CPUs and an Intel Xeon Phi 7120P co-processor with 61 cores. Using our approach we are able to find a near-optimal system configuration by performing only about 5% of all possible experiments.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
