azonenberg changed the topic of ##openfpga to: Open source tools for FPGAs, CPLDs, etc. Silicon RE, bitfile RE, synthesis, place-and-route, and JTAG are all on topic. Channel logs: https://libera.irclog.whitequark.org/~h~openfpga
cr1901 has quit [Killed (NickServ (GHOST command used by cr1901_!~cr1901@2601:8d:8600:911:40ab:efe6:2026:d4c2))]
cr1901_ is now known as cr1901
kristianpaul has quit [Ping timeout: 265 seconds]
kristianpaul has joined ##openfpga
cr1901 has quit [Read error: Connection reset by peer]
cr1901_ has joined ##openfpga
josuah has quit [Ping timeout: 268 seconds]
josuah has joined ##openfpga
Raito_Bezarius has quit [Read error: Connection reset by peer]
Raito_Bezarius has joined ##openfpga
<pie_>
is there any introductory reading / tool I can use to figure out whether I can implement something on an fpga faster than using a gpu or cpu?
<pie_>
I guess its basically a question of parallelization, but then GPUs seem like they would win out
<pie_>
except for embdedded applications that are power and or space constrained
<tpw_rules>
my personal checklist is if it involves high speed i/o
<tpw_rules>
not that i am a master of the arts
<somlo>
pie_: if you're at uni, then taking a digital design course (the kind where they do k-maps, gates, stuff like that) would probably make the most sense as a first pass. The book (haven't used it myself, but the Internet collectively seems to agree it's the best one) would be https://www.amazon.com/Digital-Design-M-Morris-Mano/dp/013212937X
<pie_>
Thanks!
<pie_>
tpw_rules: the reason this came up was because in on of my classes today, someone mentioned the GIMPS project which searches for mersenne primes
<somlo>
if you can come up with an optimized path for your data and computations to "flow" through combinational and sequential logic (gates, flip-flops, clocks, etc) then it's going to be "faster" than opcodes running on a cpu or gpu
<somlo>
"faster" depends on your clock, but in terms of algorithm efficiency :)
<somlo>
and at that point, the difference between ASIC and FPGA is just how optimized that implementation is, how much power it uses, etc
<pie_>
"The inner loop of the primality test is a large FFT, which is theclassic non-streaming task, done in double-precision floating point, which is another thing at which generic computers are significantly better than FPGAs."
<somlo>
and obviously, scaling (the "market" kind, I mean: stick with FPGAs if you plan on "deploying" hundreds of "units", go for ASIC if you want to scale up to thousands, that sort of thing)
GenTooMan has quit [Ping timeout: 260 seconds]
<pie_>
aha right
GenTooMan has joined ##openfpga
balrog has quit [Quit: Bye]
balrog has joined ##openfpga
cr1901_ is now known as cr1901
cr1901 has quit [Read error: Connection reset by peer]