Sciweavers

1862 search results - page 102 / 373
» FPGA
Sort
View
203
Voted
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
16 years 3 months ago
FPGA: what's in it for a database?
While there seems to be a general agreement that next years' systems will include many processing cores, it is often overlooked that these systems will also include an increa...
Jens Teubner, René Müller
125
Voted
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
16 years 3 months ago
FPGA Acceleration for the Frequent Item Problem
Abstract-- Field-programmable gate arrays (FPGAs) can provide performance advantages with a lower resource consumption (e.g., energy) than conventional CPUs. In this paper, we show...
Gustavo Alonso, Jens Teubner, René Mül...
105
Voted
DATE
2008
IEEE
105views Hardware» more  DATE 2008»
15 years 10 months ago
Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
Miroslav N. Velev, Ping Gao 0002
147
Voted
FCCM
2005
IEEE
139views VLSI» more  FCCM 2005»
15 years 9 months ago
A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation
Just-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously in...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan
117
Voted
FPL
2009
Springer
117views Hardware» more  FPL 2009»
15 years 8 months ago
Data parallel FPGA workloads: Software versus hardware
Commercial soft processors are unable to effectively exploit the data parallelism present in many embedded systems workloads, requiring FPGA designers to exploit it (laboriously) ...
Peter Yiannacouras, J. Gregory Steffan, Jonathan R...