Sciweavers

313 search results - page 35 / 63
» Redundancy Elimination for LF
Sort
View
MICRO
1999
IEEE
109views Hardware» more  MICRO 1999»
15 years 10 months ago
Compiler-Directed Dynamic Computation Reuse: Rationale and Initial Results
Recent studies on value locality reveal that many instructions are frequently executed with a small variety of inputs. This paper proposes an approach that integrates architecture...
Daniel A. Connors, Wen-mei W. Hwu
CONSTRAINTS
1999
120views more  CONSTRAINTS 1999»
15 years 5 months ago
Refined Inequalities for Stable Marriage
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
Brian Aldershof, Olivia M. Carducci, David C. Lore...
PLDI
1990
ACM
15 years 10 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
ICDE
2006
IEEE
169views Database» more  ICDE 2006»
16 years 7 months ago
Making Designer Schemas with Colors
XML schema design has two opposing goals: elimination of update anomalies requires that the schema be as normalized as possible; yet higher query performance and simpler query exp...
Nuwee Wiwatwattana, H. V. Jagadish, Laks V. S. Lak...
PLDI
1999
ACM
15 years 10 months ago
Load-Reuse Analysis: Design and Evaluation
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...
Rastislav Bodík, Rajiv Gupta, Mary Lou Soff...