Proceedings Tenth International Conference on VLSI Design
DOI: 10.1109/icvd.1997.568074
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic power management for microprocessors: a case study

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
14
0

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(14 citation statements)
references
References 23 publications
0
14
0
Order By: Relevance
“…The reduction in power consumption has been addressed by architecture designs and software arrangements at the instruction level [Bellas et al 2000;Chang and Pedram 1995;Horowitz et al 1994;Lee et al 2003Lee et al , 1997Su and Despain 1995;Tiwari et al 1997Tiwari et al , 1998]. The efforts to reduce dynamic power include software rearrangements to optimize the value locality of registers [Chang and Pedram 1995], the swapping of operands for the Booth multiplier [Lee et al 1997], the scheduling of VLIW instructions to reduce the power consumption on the instruction bus ], gating the clock to reduce workloads [Horowitz et al 1994;Tiwari et al 1997Tiwari et al , 1998], cache subbanking mechanism [Su and Despain 1995], and the utilization of the instruction cache [Bellas et al 2000].…”
Section: Related Workmentioning
confidence: 99%
“…The reduction in power consumption has been addressed by architecture designs and software arrangements at the instruction level [Bellas et al 2000;Chang and Pedram 1995;Horowitz et al 1994;Lee et al 2003Lee et al , 1997Su and Despain 1995;Tiwari et al 1997Tiwari et al , 1998]. The efforts to reduce dynamic power include software rearrangements to optimize the value locality of registers [Chang and Pedram 1995], the swapping of operands for the Booth multiplier [Lee et al 1997], the scheduling of VLIW instructions to reduce the power consumption on the instruction bus ], gating the clock to reduce workloads [Horowitz et al 1994;Tiwari et al 1997Tiwari et al , 1998], cache subbanking mechanism [Su and Despain 1995], and the utilization of the instruction cache [Bellas et al 2000].…”
Section: Related Workmentioning
confidence: 99%
“…Recently, new research directions in reducing power consumptions have begun to address the issues on the aspect of architecture designs and on software arrangements at instruction-level to help reduce power consumptions. [1,5,8,11,12,17,19,20]. In order to reduce the dynamic power, several research work have been proposed to reduce the dissipation.…”
Section: Introductionmentioning
confidence: 99%
“…In order to reduce the dynamic power, several research work have been proposed to reduce the dissipation. For example, software rearrangements to utilize the value locality of registers [5], the swapping of operands for booth multiplier [12], the scheduling of VLIW instructions to reduce the power consumption on the instruction bus [11], gating clock to reduce workloads [8,19,20], cache sub-banking mechanism [17], the utilization of instruction cache [1], etc.…”
Section: Introductionmentioning
confidence: 99%
“…Numerous studies in the literature on low-power design have proposed various techniques for synthesizing designs with reduced transitional activities. Recently, the prospect of combining architecture design and software arrangement at the instruction level has been addressed to help reduce power consumption [Bellas et al 2000;Chang and Pedram 1995;Horowitz et al 1994;Lee et al 2003;Su and Despain 1995;Tiwari et al 1998Tiwari et al , 1997 For example, several types of software rearrangement have been used to reduce the dynamic power, such as utilizing the value locality of registers [Chang and Pedram 1995], swapping operands for Booth multipliers [Lee et al 1997], scheduling VLIW instructions to reduce the power consumption on the instruction bus [Lee et al 2003], gating the clock to reduce workloads [Horowitz et al 1994;Tiwari et al 1998Tiwari et al , 1997, utilizing cache subbanking mechanisms [Su and Despain 1995], and an instruction cache for loops [Bellas et al 2000].…”
Section: Introductionmentioning
confidence: 99%