Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
one-more-minute
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
16 ms
·
91.
▲
by
one-more-minute
9y ago
If you can turn one of those trials into a small example and post it on the forums, it'd be well worthwhile. We've often helped folks squeeze the last few bits of performance out of their code – and really, anything past 2x of C i
92.
▲
by
one-more-minute
9y ago
To add to Keno's comment, a bunch of this stuff actually can work with OpenCL and OpenGL, and you can see it in action in GPUArrays.jl [1]. In general, there's a bunch of work to make Julia as hardware-agnostic as possible, but
93.
▲
Generic GPU Kernels in Julia
(mikeinnes.github.io)
157 points
by
one-more-minute
9y ago
|
14 comments
94.
▲
by
one-more-minute
9y ago
Take a look at Celeste [1], which ran on the Cori supercomputer. At that level you really need high performance not just for numerics but also for IO and heavily custom data structures, which was previously only possible in Fortran and C++.
95.
▲
Julia Computing bags grant worth $910K
(vccircle.com)
1 points
by
one-more-minute
9y ago
|
0 comments
96.
▲
Investing in Julia Computing
(hackernoon.com)
12 points
by
one-more-minute
9y ago
|
3 comments
97.
▲
A Julia Tutorial
(github.com)
3 points
by
one-more-minute
9y ago
|
0 comments
98.
▲
Exploring Lazy Evaluation with Julia
(mikeinnes.github.io)
1 points
by
one-more-minute
9y ago
|
1 comments
99.
▲
GitHub integration for Atom
(github.com)
4 points
by
one-more-minute
9y ago
|
0 comments
100.
▲
by
one-more-minute
9y ago
Your argument is deeply confused. First Python is "much better than Julia for building modular applications", now it's flawed for the same reasons as Julia? Feature requests are fine but let's make them coherent please.
101.
▲
by
one-more-minute
9y ago
See also the case study on the JC website, which includes a talk from one of the developers explaining some of the rationale: https://juliacomputing.com/case-studies/ny-fed.html
102.
▲
by
one-more-minute
9y ago
Julia is JITed, but not in the same sense that (say) JavaScript is. It's more like a very lazy AOT compiler – and it can certainly hold its own against Fortran. That's not to say it has every optimisation it could, but the JIT is
103.
▲
FRACTRAN
(en.wikipedia.org)
82 points
by
one-more-minute
9y ago
|
8 comments
104.
▲
by
one-more-minute
10y ago
One difference in other languages is that the extra indirection will add overhead. You have to (at the very least) hop through an extra function call, and even that will become significant if you're writing an image kernel. Julia can i
105.
▲
by
one-more-minute
10y ago
Interesting to note that BlackRock's Aladdin software platform, powering much of this stuff, is being largely written / re-written in Julia. https://juliacomputing.com/case-studies/blackrock.html
106.
▲
How an IDE, a language, and a mentality cause harm
(neuroplausible.com)
3 points
by
one-more-minute
10y ago
|
0 comments
107.
▲
Julia: A Fresh Approach to Numerical Computing [pdf]
(julialang.org)
2 points
by
one-more-minute
10y ago
|
0 comments
108.
▲
Compiling Julia to the GPU
(julialang.org)
3 points
by
one-more-minute
10y ago
|
0 comments
109.
▲
Some fun with π in Julia
(julialang.org)
188 points
by
one-more-minute
10y ago
|
64 comments
110.
▲
Native GPU programming in Julia
(julialang.org)
5 points
by
one-more-minute
10y ago
|
0 comments
111.
▲
The Motivation for Julia
(discourse.julialang.org)
3 points
by
one-more-minute
10y ago
|
0 comments
112.
▲
by
one-more-minute
10y ago
By duck typing, I mean that you can write: f(x) = x^2 + 2 for example, and the function will happily run with any type that supports multiply and add. This is in contrast to languages where `x` has to explicitly inherit from a give
113.
▲
by
one-more-minute
10y ago
Check out ForwardDiff.jl [1], which is a really impressive implementation of this exact idea. The technique gets pretty magical results; you can apply it to any function, complete with loops, linalg etc, and it will compute a derivative wit
114.
▲
by
one-more-minute
10y ago
All the particles in the simulation start at (0, 0, 0) so gravity is infinite, and the whole computation is operating on `NaN`s. Not sure how much this affects the benchmark, but it'd probably be smart to randomise the starting positio
115.
▲
Syntactic loop fusion in Julia
(julialang.org)
37 points
by
one-more-minute
10y ago
|
0 comments
116.
▲
Neutral Style in Julia on GPUs
(juliacomputing.com)
1 points
by
one-more-minute
10y ago
|
0 comments
117.
▲
Julia Computing
(juliacomputing.com)
2 points
by
one-more-minute
10y ago
|
0 comments
118.
▲
Option (filmmaking)
(en.wikipedia.org)
1 points
by
one-more-minute
10y ago
|
0 comments
119.
▲
Graydon Hoare on Ousterhout's Dichotomy and Julia
(graydon2.dreamwidth.org)
3 points
by
one-more-minute
10y ago
|
0 comments
120.
▲
How Traders and Economists Are Using Julia
(waterstechnology.com)
4 points
by
one-more-minute
10y ago
|
0 comments
More ›