VLIW Instruction Scheduling for Minimal Power Variation

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

The focus of this paper is on the minimization of the variation in power consumed by a VLIW processor during the execution of a target program through instruction scheduling. The problem is formulated as a mixed-integer program (MIP) and a problem-specific branch-and-bound algorithm has been developed to solve it more efficiently than generic MIP solvers. Simulation results based on the TMS320C6711 VLIW digital signal processor using benchmarks from Mediabench and Trimaran showed that over 40% average reduction in power variation can be achieved without sacrificing execution speed of these benchmarks. Computational requirements and convergence rates of our algorithm are also analyzed. © 2007, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Xiao, S., & Lai, E. M. K. (2007). VLIW Instruction Scheduling for Minimal Power Variation. ACM Transactions on Architecture and Code Optimization, 4(3), 18. https://doi.org/10.1145/1275937.1275942

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free