Sciweavers

360 search results - page 46 / 72
» Speculative Computation in Multilisp
Sort
View
ICVS
2001
Springer
15 years 2 months ago
Compiling SA-C Programs to FPGAs: Performance Results
Abstract. At the first ICVS, we presented SA-C (“sassy”), a singleassignment variant of the C programming language designed to exploit both coarse-grain and fine-grain parallel...
Bruce A. Draper, A. P. Wim Böhm, Jeffrey Hamm...
92
Voted
IPPS
2005
IEEE
15 years 3 months ago
Control-Flow Independence Reuse via Dynamic Vectorization
Current processors exploit out-of-order execution and branch prediction to improve instruction level parallelism. When a branch prediction is wrong, processors flush the pipeline ...
Alex Pajuelo, Antonio González, Mateo Valer...
VISUALIZATION
2003
IEEE
15 years 3 months ago
Planet-Sized Batched Dynamic Adaptive Meshes (P-BDAM)
We describe an efficient technique for out-of-core management and interactive rendering of planet sized textured terrain surfaces. The technique, called P-Batched Dynamic Adaptiv...
Paolo Cignoni, Fabio Ganovelli, Enrico Gobbetti, F...
RC
2002
70views more  RC 2002»
14 years 9 months ago
On Existence and Uniqueness Verification for Non-Smooth Functions
Given an approximate solution to a nonlinear system of equations at which the Jacobi matrix is nonsingular, and given that the Jacobi matrix is continuous in a region about this ap...
R. Baker Kearfott
DAC
2000
ACM
15 years 10 months ago
Formal verification of iterative algorithms in microprocessors
Contemporary microprocessors implement many iterative algorithms. For example, the front-end of a microprocessor repeatedly fetches and decodes instructions while updating interna...
Mark Aagaard, Robert B. Jones, Roope Kaivola, Kath...