Energy Consumption and Performance of Heapsort in Hardware and Software
Maja H. Kirkeby, Thomas Krabben, Mathias Larsen, Maria B., Mikkelsen, Tjark Petersen, Mads Rosendahl, Martin Schoeberl and, Martin Sundman

TL;DR
This study compares the energy efficiency and performance of Heapsort implemented in hardware versus software, revealing trade-offs between energy consumption and speed, and how parallelization affects optimization.
Contribution
It provides a comparative analysis of hardware and software Heapsort implementations focusing on energy and performance metrics.
Findings
Hardware Heapsort is more energy efficient but slower than software.
Optimal parallelization degree varies depending on whether the goal is speed or energy efficiency.
Hardware implementation's lower clock frequency impacts its speed.
Abstract
In this poster abstract we will report on a case study on implementing the Heapsort algorithm in hardware and software and comparing their time and energy consumption. Our experiment shows that the Hardware implementation is more energy efficient, but slower than the Software implementation due to a low clock frequency. It also indicate that the optimal degree of parallelization differs when optimizing for time compared to optimizing for time.
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.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Metaheuristic Optimization Algorithms Research
