Sciweavers

1294 search results - page 105 / 259
» FFT Compiler Techniques
Sort
View
IPPS
1997
IEEE
14 years 1 months ago
The Sparse Cyclic Distribution against its Dense Counterparts
Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real a...
Gerardo Bandera, Manuel Ujaldon, María A. T...
MICRO
1994
IEEE
118views Hardware» more  MICRO 1994»
14 years 29 days ago
Characterizing the impact of predicated execution on branch prediction
Branch instructions are recognized as a major impediment to exploiting instruction level parallelism. Even with sophisticated branch prediction techniques, many frequently execute...
Scott A. Mahlke, Richard E. Hank, Roger A. Bringma...
ISSTA
1993
ACM
14 years 28 days ago
Mutation Analysis Using Mutant Schemata
Mutation analysis is a powerful technique for assessing and improving the quality of test data used to unit test software. Unfortunately, current automated mutation analysis syste...
Roland H. Untch, A. Jefferson Offutt, Mary Jean Ha...
ASPLOS
2006
ACM
14 years 18 days ago
Efficient type and memory safety for tiny embedded systems
We report our experience in implementing type and memory safety in an efficient manner for sensor network nodes running TinyOS: tiny embedded systems running legacy, C-like code. ...
John Regehr, Nathan Cooprider, Will Archer, Eric E...
EUROPAR
2000
Springer
14 years 13 days ago
Cache Remapping to Improve the Performance of Tiled Algorithms
With the increasing processing power, the latency of the memory hierarchy becomes the stumbling block of many modern computer architectures. In order to speed-up the calculations, ...
Kristof Beyls, Erik H. D'Hollander