27 search results - page 5 / 6 » Automatic useless-code elimination for HOT functional progra... |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
ICFP
1997
ACM
13 years 9 months ago
1997
ACM
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
PLDI
1993
ACM
13 years 9 months ago
1993
ACM
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
PLDI
2011
ACM
12 years 8 months ago
2011
ACM
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
TPHOL
1999
IEEE
13 years 9 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...