Map
Index
Random
Help
th

Quote: ABCD-eliminate array bounds checks on demand; sparse SSA analysis; removes 45% of bounds checks

topics > all references > references a-b > QuoteRef: bodiR6_2000 , p. abstract



Topic:
range checking
Topic:
code optimization
Topic:
static single assignment; SSA
Topic:
code optimization by global analysis
Topic:
dependency analysis

Quotation Skeleton

ABCD is a light-weight algorithm for elimination of … adding a few edges to the SSA value … On our benchmarks, ABCD removes on average 45% … factors. First, ABCD works on a sparse representation. … Second, ABCD is demand-driven. It can be applied … setting, in which compile-time cost is constrained but … [p. 33] We measured run-time speedup on the Symantec … [Java] … to the limitations of the infrastructure outlined above. …   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: range checking (20 items)
Topic: code optimization (54 items)
Topic: static single assignment; SSA (19 items)
Topic: code optimization by global analysis (23 items)
Topic: dependency analysis (31 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.