Sciweavers

1294 search results - page 135 / 259
» FFT Compiler Techniques
Sort
View
ASPLOS
2006
ACM
14 years 2 months ago
Accelerator: using data parallelism to program GPUs for general-purpose uses
GPUs are difficult to program for general-purpose uses. Programmers can either learn graphics APIs and convert their applications to use graphics pipeline operations or they can ...
David Tarditi, Sidd Puri, Jose Oglesby
FPGA
2005
ACM
107views FPGA» more  FPGA 2005»
14 years 2 months ago
Instruction set extension with shadow registers for configurable processors
Configurable processors are becoming increasingly popular for modern embedded systems (especially for the field-programmable system-on-a-chip). While steady progress has been made...
Jason Cong, Yiping Fan, Guoling Han, Ashok Jaganna...
HVC
2005
Springer
113views Hardware» more  HVC 2005»
14 years 2 months ago
Choosing Among Alternative Futures
Non-determinism is a serious impediment to testing and debugging concurrent programs. Such programs do not execute the same way each time they are run, which can hide the presence ...
Steve MacDonald, Jun Chen, Diego Novillo
TCC
2004
Springer
105views Cryptology» more  TCC 2004»
14 years 2 months ago
Unfair Noisy Channels and Oblivious Transfer
In a paper from EuroCrypt’99, Damg˚ard, Kilian and Salvail show various positive and negative results on constructing Bit Commitment (BC) and Oblivious Transfer (OT) from Unfair...
Ivan Damgård, Serge Fehr, Kirill Morozov, Lo...
PLDI
2003
ACM
14 years 2 months ago
Taming the IXP network processor
We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal b...
Lal George, Matthias Blume