A dynamic-programming algorithm for reducing the energy consumption of pipelined System-Level streaming applications

In this paper we present a System-Level technique for reducing energy consumption. The technique is applicable to pipelined applications represented as chain-structured graphs and targets the energy overhead of switching between active and sleep mode. The overhead is reduced by increasing the number...

Full description

Saved in:
Bibliographic Details
Main Authors: Liveris, N., Zhou, H., Banerjee, P.
Format: Conference Proceeding
Language:English
Subjects:
Delay
Digital signal processing
Energy consumption
Heuristic algorithms
Pipelines
Power dissipation
Signal processing algorithms
Streaming media
Switches
Throughput
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we present a System-Level technique for reducing energy consumption. The technique is applicable to pipelined applications represented as chain-structured graphs and targets the energy overhead of switching between active and sleep mode. The overhead is reduced by increasing the number of consecutive executions of the pipeline stages. The technique has no impact on the average throughput. We derive upper bounds on the number of consecutive executions and present a dynamic-programming algorithm that finds the optimal solution using these bounds. For specific cases we derive a quality metric that can be used to trade quality of the result for running-time.
ISSN:2153-6961
2153-697X
DOI:10.1109/ASPDAC.2008.4483989