Sciweavers

487 search results - page 47 / 98
» A Compiled Implementation of Normalization by Evaluation
Sort
View
IPPS
2002
IEEE
15 years 8 months ago
Efficient Pipelining of Nested Loops: Unroll-and-Squash
The size and complexity of current custom VLSI have forced the use of high-level programming languages to describe hardware, and compiler and synthesis technology bstract designs ...
Darin Petkov, Randolph E. Harr, Saman P. Amarasing...
ECOOP
2010
Springer
15 years 8 months ago
A Type System for Data-Centric Synchronization
Data-centric synchronization groups fields of objects into atomic sets to indicate they must be updated atomically. Each atomic set has associated units of work, code fragments th...
Mandana Vaziri, Frank Tip, Julian Dolby, Christian...
LCPC
1998
Springer
15 years 7 months ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...
126
Voted
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 7 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
123
Voted
DIMVA
2009
15 years 4 months ago
Polymorphing Software by Randomizing Data Structure Layout
Abstract. This paper introduces a new software polymorphism technique that randomizes program data structure layout. This technique will generate different data structure layouts f...
Zhiqiang Lin, Ryan Riley, Dongyan Xu