Sciweavers

663 search results - page 76 / 133
» Reducing Compilation Time Overhead in Compiled Simulators
Sort
View
EUROPAR
2003
Springer
14 years 1 months ago
Improving Performance of Hypermatrix Cholesky Factorization
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
José R. Herrero, Juan J. Navarro
CASES
2009
ACM
14 years 1 days ago
Exploiting residue number system for power-efficient digital signal processing in embedded processors
2's complement number system imposes a fundamental limitation on the power and performance of arithmetic circuits, due to the fundamental need of cross-datapath carry propaga...
Rooju Chokshi, Krzysztof S. Berezowski, Aviral Shr...
PPL
2008
96views more  PPL 2008»
13 years 8 months ago
A Hybrid Shared Memory Execution Model for a Data Parallel Language with I/O
Execution of programs with data parallel language constructs is either based on the fork/join or on the SPMD model. Whereas the former executes a program sequentially and confines...
Clemens Grelck, Steffen Kuthe, Sven-Bodo Scholz
TCAD
2008
118views more  TCAD 2008»
13 years 8 months ago
CHIPS: Custom Hardware Instruction Processor Synthesis
This paper describes an integer-linear-programming (ILP)-based system called Custom Hardware Instruction Processor Synthesis (CHIPS) that identifies custom instructions for critica...
Kubilay Atasu, Can C. Özturan, Günhan D&...
IEEEPACT
2005
IEEE
14 years 1 months ago
An Event-Driven Multithreaded Dynamic Optimization Framework
Dynamic optimization has the potential to adapt the program’s behavior at run-time to deliver performance improvements over static optimization. Dynamic optimization systems usu...
Weifeng Zhang, Brad Calder, Dean M. Tullsen