Sciweavers

83 search results - page 1 / 17
» An Improved Redundancy Elimination Algorithm for Underspecif...
Sort
View
ACL
2006
13 years 6 months ago
An Improved Redundancy Elimination Algorithm for Underspecified Representations
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
Alexander Koller, Stefan Thater
IEEEPACT
2008
IEEE
13 years 11 months ago
Redundancy elimination revisited
This work proposes and evaluates improvements to previously known algorithms for redundancy elimination. Enhanced Scalar Replacement combines two classic techniques, scalar replac...
Keith D. Cooper, Jason Eckhardt, Ken Kennedy
PLDI
1994
ACM
13 years 8 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar
JUCS
2006
87views more  JUCS 2006»
13 years 4 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
ENTCS
2008
92views more  ENTCS 2008»
13 years 4 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed