ICE: A General and Validated Energy Complexity Model for Multithreaded Algorithms
Vi Ngoc-Nha Tran, Phuong Hoai Ha

TL;DR
This paper introduces a validated, general energy complexity model for multithreaded algorithms that accurately predicts energy consumption across various algorithms, inputs, and platforms, aiding energy-efficient algorithm development.
Contribution
It presents a novel, validated energy complexity model for parallel algorithms that abstracts platform specifics and applies broadly to different algorithms and hardware.
Findings
Model accurately predicts energy consumption for SpMV and matmul.
Experimental validation confirms predictions across multiple platforms.
Platform parameters provided for eleven diverse hardware platforms.
Abstract
Like time complexity models that have significantly contributed to the analysis and development of fast algorithms, energy complexity models for parallel algorithms are desired as crucial means to develop energy efficient algorithms for ubiquitous multicore platforms. Ideal energy complexity models should be validated on real multicore platforms and applicable to a wide range of parallel algorithms. However, existing energy complexity models for parallel algorithms are either theoretical without model validation or algorithm-specific without ability to analyze energy complexity for a wide-range of parallel algorithms. This paper presents a new general validated energy complexity model for parallel (multithreaded) algorithms. The new model abstracts away possible multicore platforms by their static and dynamic energy of computational operations and data access, and derives the energy…
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.
