Summary of Results

Code Motion

Safe code motion based

• Array bound checks

- LOPLAS’94 [Gupta]

• Load-Store elimination

- IJPP’97 [Bodik,Gupta]

Path profile guided

• Speculation based PRE

- ICCL’98

• Predication based PDE

- PACT’97

[Gupta,Berson,Fang]

Resource sensitive opt.

• Functional units

- MICRO’97

[Gupta,Berson,Fang]

• Register pressure

- CC’99 [Gupta,Bodik]

Restructuring

Restructuring PDE

- PLDI’97 [Bodik,Gupta]

Restructuring PRE

- PLDI’98

[Bodik,Gupta,Soffa]

Demand driven

• Cond. branch elim.

- PLDI’97

• Load redundancy

- PLDI’99

[Bodik,Gupta,Soffa]

• Array bounds checks

- PLDI’00

[Bodik,Gupta,Sarkar]

Demand driven basics

- TOPLAS’97

[Duesterwald,Gupta,Soffa]

Hardware

Analysis & Optimization

• Load speculation

- MICRO’99

• Branch sequences

- PACT’99

• Instruction issue

- PACT’98

[Onder,Gupta]

Value prediction

• Superscalars

- HPCA’99

• VLIW machines

- ISCA’99

[Nakra,Gupta,Soffa]

Load reuse

- ICPP’00 [Yang, Gupta]

Previous slide

Back to first slide

View graphic version