Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/25268
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: Search-based energy optimization of some ubiquitous algorithms
Authors: Brownlee, Alexander
Burles, Nathan
Swan, Jerry
Contact Email: sbr@cs.stir.ac.uk
Keywords: Search based software engineering
Java
energy
Issue Date: Jun-2017
Citation: Brownlee A, Burles N & Swan J (2017) Search-based energy optimization of some ubiquitous algorithms, IEEE Transactions on Emerging Topics in Computational Intelligence, 1 (3), pp. 188-201.
Abstract: Reducing computational energy consumption is of growing importance, particularly at the extremes (i.e. mobile devices and datacentres). Despite the ubiquity of the Java TM Virtual Machine (JVM), very little work has been done to apply Search Based Software Engineering (SBSE) to minimize the energy consumption of programs that run on it. We describe OPACITOR , a tool for measuring the energy consumption of JVM programs using a bytecode level model of energy cost. This has several advantages over time-based energy approximations or hardware measurements. It is: * deterministic.  * unaffected by the rest of the computational environment.  * able to detect small changes in execution profile, making it highly amenable to metaheuristic search which requires locality of representation. We show how generic SBSE approaches coupled with OPACITOR achieve substantial energy savings for three widely-used software components. Multi-Layer Perceptron implementations minimis- ing both energy and error were found, and energy reductions of up to 70% and 39.85% were obtained over the original code for Quicksort and Object-Oriented container classes respectively. These highlight three important considerations for automatically reducing computational energy: tuning software to particular distributions of data; trading off energy use against functional properties; and handling internal dependencies which can exist within software that render simple sweeps over program variants sub-optimal. Against these, global search greatly simplifies the developer’s job, freeing development time for other tasks.
DOI Link: http://dx.doi.org/10.1109/TETCI.2017.2699193
Rights: This work is licensed under a Creative Commons Attribution 3.0 License. For more information, see http://creativecommons.org/licenses/by/3.0/

Files in This Item:
File Description SizeFormat 
Brownlee_etal_IEEEETCI_2017.pdf582.4 kBAdobe PDFView/Open



This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.