Performance Comparison for Scientific Computations on the Edge via Relative Performance
Aravind Sankaran, Paolo Bientinesi

TL;DR
This paper introduces a measurement-based method called 'Relative performance analysis' to cluster algorithms into performance classes based on pairwise comparisons, aiding multi-metric algorithm selection in IoT scientific computations.
Contribution
It proposes a novel clustering methodology for algorithms based on pairwise performance comparisons, enabling multi-metric evaluation and selection.
Findings
Algorithms can be effectively clustered into performance classes.
The approach supports multi-metric algorithm selection.
Clustering simplifies choosing algorithms based on energy and other metrics.
Abstract
In a typical Internet-of-Things setting that involves scientific applications, a target computation can be evaluated in many different ways depending on the split of computations among various devices. On the one hand, different implementations (or algorithms)--equivalent from a mathematical perspective--might exhibit significant difference in terms of performance. On the other hand, some of the implementations are likely to show similar performance characteristics. In this paper, we focus on analyzing the performance of a given set of algorithms by clustering them into performance classes. To this end, we use a measurement-based approach to evaluate and score algorithms based on pair-wise comparisons; we refer to this approach as"Relative performance analysis". Each comparison yields one of three outcomes: one algorithm can be "better", "worse", or "equivalent" to another; those…
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.
