I mentioned localize_vars() since it is one of the differences between the
implementations of @everywhere and @spawnat. But, there is something else
also going on that I don't understand.
On Sun, Nov 23, 2014 at 12:13 PM, Madeleine Udell madeleine.ud...@gmail.com
wrote:
Yes, I read the code,
Le samedi 22 novembre 2014 à 14:56 -0800, Jacek Hoła a écrit :
It seemed pretty handy to have one test in just one file. I used
readdlm and it works great, but now I have 4 files (3 matrices and one
jl with readdlms and call to module). Guess I can live with that.
I see. Jeff could give you an
Le samedi 22 novembre 2014 à 19:24 -0800, Christian Peel a écrit :
Hi all,
I'm excited about Julia because of the speed and open nature of the
language. I have a couple of suggestions from the past couple of days
of my time with the language: (1) decrease the JIT time to allow
faster code
About the parallel programming in julia.
Considering the DummyModule example (Julia Language Documentation, Release
0.4.0-dev, p.157)
we continue with
bin\julia.exe -p 4
include(“. . ./DummyModule.jl”)
using DummyModule
@everywhere a=[1,2,3,4]
@parallel (+) for i=1:4
f(a[i])
end
Milan,
Thanks for the comments. I also am confident that info about what line
errors occur on will improve.
You asked about a specific example of catching errors early. I just meant
that running something like Lint as part of the 'include' command could
help improve the speed of the
Not sure why it works on the 2nd attempt, but this may help:
http://docs.julialang.org/en/latest/manual/parallel-computing/#code-availability-and-loading-packages
--Tim
On Sunday, November 23, 2014 12:11:59 AM Erno Scheiber wrote:
About the parallel programming in julia.
Considering the
On Sun, Nov 23, 2014 at 6:02 AM, Christian Peel sanpi...@gmail.com wrote:
Milan,
Thanks for the comments. I also am confident that info about what line
errors occur on will improve.
For some context, the reason traditional dynamic systems like e.g. Matlab
or Python, don't have this issue
On Sun, Nov 23 2014, Stefan Karpinski ste...@karpinski.org wrote:
On Sun, Nov 23, 2014 at 6:02 AM, Christian Peel sanpi...@gmail.com wrote:
Milan,
Thanks for the comments. I also am confident that info about what line
errors occur on will improve.
For some context, the reason
Totally understandable – not everyone is going to jump into contributing
code generation improvements to LLVM. If you're willing, however, you can
still help LLVM (and thus indirectly Julia) by filing an issue
http://llvm.org/bugs/ requesting support for the new instruction. In
particular, I
Parsing a data file is the way to go here. In C, you can include large
chunks of data since the parsing occurs at compile time. In Julia, parsing
happens at run time and it's going to be noticeable. The parser for a
simple data format is much more specialized and thus likely to be faster
than
I'd rather shoot for always fast, always good debug info :-). We're not
very far off, we just need to keep upstreaming improvements to LLVM.
On Sun, Nov 23, 2014 at 8:16 AM, Tamas Papp tkp...@gmail.com wrote:
On Sun, Nov 23 2014, Stefan Karpinski ste...@karpinski.org wrote:
On Sun, Nov 23,
Hi Arshak,
Mocha is a pretty new package (which looks really interesting!). As such
it's probably the case that not many people use it yet, so you might try
opening an issue at https://github.com/pluskid/Mocha.jl/issues
Cheers,
Kevin
On Sunday, November 23, 2014, Arshak Navruzyan
Hi all,
I troubled with binding C code to Julia.
C code witch I want to bind have cross dependent structs like following,
```
struct node {
struct node *next;
struct path *path;
...
}
struct path {
struct node *rnode;
struct path *lnext;
...
}
```
I know we can bind if I implement
It looks like LLVM already has intrinsics for these instructions:
https://github.com/llvm-mirror/llvm/blob/d5391478340c6e63b28d03c29ea9fde580b38e93/include/llvm/IR/IntrinsicsX86.td#L2709-L2729
I'll try using these later – I'm excited about the prospect of branch-free
UTF-8 character decoding
On Saturday, November 22, 2014 10:06:24 PM UTC-6, Joshua Adelman wrote:
I just checked out StrPack and installed it. I think I have it working
properly in the case of a packed immutable type that just contains
numerical fields. I'm still not sure how to make things work to unpack
fixed
Isaiah
Thanks for your great response and the suggestion that I contribute. I'll
keep an eye out for something useful that I can do.
Chris
On Saturday, November 22, 2014 10:19:59 PM UTC-8, Isaiah wrote:
Thanks for the comments. Many of these things are on the radar, and
contributions are
You can already inline assembly into llvm so it's not super clean but it
can be done.
Do you have any examples of this in use? I tried some simple things based
on the examples in the LLVM manual and got Failed to parse LLVM assembly
errors. I had thought this was unavailable with the old JIT,
I have not – Keno mentioned that it should be possible, so maybe he can
expand on that.
On Sun, Nov 23, 2014 at 12:47 PM, Isaiah Norton isaiah.nor...@gmail.com
wrote:
You can already inline assembly into llvm so it's not super clean but
it can be done.
Do you have any examples of this in
Stefan,
Thank you for the explanation of the issues with line numbers and LLVM, and
how it compares with Matlab and Julia.
In your recent papers and on http://julialang.org/benchmarks/ we can see
that Julia is among the fastest languages to *run*. I'd be very interested
to see the speed
* At the matlab prompt, I can type 'str then ctrl-P and it finds the
most recent command in the history that starts with 'str' and puts it
on my command line. I can then hit enter immediately and execute it.
It appears that with the current Julia setup, one has to type ctrl-R
to enter
Le dimanche 23 novembre 2014 à 10:32 -0800, Christian Peel a écrit :
Stefan,
Thank you for the explanation of the issues with line numbers and
LLVM, and how it compares with Matlab and Julia.
In your recent papers and on http://julialang.org/benchmarks/ we can
see that Julia is among the
I was refering mainly to the BMI instructions. Some like bextr should be
recognizable by a pattern.
Something like: ( xshift ) ((0x1len) -1) for bextr(x,shift,len). The GCC
intrinsic actually append shift to length to form an uint.
As for pext or pdef, they are full fledge functions that
Hi,
using JuMP we have a relatively easy way to solve for non-linear problems.
Usually we have the following preamble:
#
using JuMP
using Ipopt # For any kind of constraints
m = Model(solver=IpoptSolver())
...
#
Hey guys,
I am a Julia beginner and I try to learn the language by writing simple
sample code. Currently I want to generate a simple figure with subplots
where the first [1,1] is a contour plot and the second one [1,2] should be
a 3D Surface plot. I managed to generate a subplot with 2 2D
I think you should have PyPlot in front of the commands and at the very end
PyPlot.show().
I was able to create a simple graph using the following code:
#
-
import PyPlot
x = linspace(0,
I think Christian has a good point.
The time in Julia does depend on how many extra packages, etc, one loads. In
Jameson's up-and-coming caching work, packages should get compiled the first
time you use them, and thereafter be very fast to load. But if your package
has a large codebase on its
This works:
ax = fig[:add_subplot](2,1,1, projection = 3d)
xgrid = repmat(x',n,1)
ygrid = repmat(y,1,n)
ax[:plot_surface](xgrid, ygrid, z, rstride=2,edgecolors=k, cstride=2,
cmap=ColorMap(gray), alpha=0.8, linewidth=0.25)
xlabel(X)
ylabel(Y)
subplot(212)
ax = fig[:add_subplot](2,1,2)
cp =
OK,
for future reference I have found this site with many information about the
options: http://www.coin-or.org/Ipopt/documentation/node39.html
I also provide a simple example of what one can use:
# ===
using JuMP
using Ipopt
If you want to get the most out of Julia it might be best to unlearn the
Matlab practice of writing 500-line functions – this will probably solve a
lot of your problems. This might sound crazy, but I tend to treat anything
much longer than about 10 lines as code smell.
There are a whole bunch of
Whoops, I meant to say that string concatenation is not commutative, not
not associative... you know what I mean.
On 23 November 2014 at 20:40, Mike Innes mike.j.in...@gmail.com wrote:
If you want to get the most out of Julia it might be best to unlearn the
Matlab practice of writing 500-line
On Sun, Nov 23, 2014 at 3:05 PM, eric l cdg2...@gmail.com wrote:
I was refering mainly to the BMI instructions. Some like bextr should be
recognizable by a pattern.
Something like: ( xshift ) ((0x1len) -1) for bextr(x,shift,len). The
GCC intrinsic actually append shift to length to form an
On Sunday, November 23, 2014 3:37:52 PM UTC-5, Pileas wrote:
One last question that I have is whether we can use some kind of delimiter
that can give us the result in a csv file, but not in one column, but
rather in deifferent ones.
It's better to just print out the file in the format
OK, I have the following model in which I try to solve the Bellman equation
through function iteration. However somewhere I am wrong.
This is the code:
=
sigma = 1.5; # utility parameter
delta = 0.1;
Did you try running any of the individual lines? There’s a very obvious bug
where you refer to kgrid(i).
— John
On Nov 23, 2014, at 3:39 PM, Pileas phoebus.apollo...@gmail.com wrote:
OK, I have the following model in which I try to solve the Bellman equation
through function iteration.
Use [] to index instead of ().
On Sunday, November 23, 2014 6:39:49 PM UTC-5, Pileas wrote:
OK, I have the following model in which I try to solve the Bellman
equation through function iteration. However somewhere I am wrong.
This is the code:
Tim,
The 11 seconds was entirely spent in compiling the 6 functions in the file
that I was working on. I had no 'using' or 'include' commands in the file;
I think the time was entirely compilation.
I would be happy with the mode you suggest. I see it as a development
mode; ideally in
I changed the code like this, but I still get an error:
~
while crit epsi;
for i = 1:nbk
#compute indexes for which consumption is positive
tmp = (kgrid[i]^alpha+(1-delta)*kgrid[i]-kmin);
imax = min(floor(tmp/dk)+1,nbk);
#consumption and
indexes should be in square brackets e.g. kgrid[i] instead of kgrid(i)and
secondly in # find value function step you try to assign values to two
variables even though right side gives you only one numerical value... plus
variable tv is not defined before that assignment...
On Monday, November
OK, I took into consideration what people said in this group.
I changed the code (see below) and I get results.
I want to save the results in a .csv file, but instead of getting three
columns, I get all the results in one column.
sigma = 1.5; # utility parameter
delta = 0.1;
Hello!
I'm looking to use Julia for an upcoming project and right now I'm trying
to do a simple example which includes everything I need.I managed to
port/code the application and the results are correct. Now I'm stuck trying
to parallelize it.
My experience is with MPI on C. I use broadcast +
On Sunday, November 23, 2014 04:23:18 PM Christian Peel wrote:
The 11 seconds was entirely spent in compiling the 6 functions in the file
that I was working on. I had no 'using' or 'include' commands in the file;
I think the time was entirely compilation.
You must have used `include` or
11 seconds seems like an awfully long time. In the days of the slow REPL when
Julia compiled itself upon starting up, that's about how long it took. What's
your versioninfo?
On Nov 23, 2014, at 8:37 PM, Tim Holy tim.h...@gmail.com wrote:
On Sunday, November 23, 2014 04:23:18 PM Christian
On Sunday, November 23, 2014 7:55:33 PM UTC-6, Stefan Karpinski wrote:
11 seconds seems like an awfully long time. In the days of the slow REPL
when Julia compiled itself upon starting up, that's about how long it took.
What's your versioninfo?
Windows doesn't ship with sys.dll, for what
Everything in a language I need but the examples
at http://julialang.org/learning/ like
Parallel Julia by Douglas Eadline in Admin magazine
Just blow up:
tic();
julia nheads = @parallel (+) for i=1:1
randbit()
end;
exception on 2: exception on 5: exception on
Ah, yes. That would explain this if you're timing how long it takes to
start Julia from the command prompt. In that case, I can understand the
complaint about the compile-debug-edit cycle, but you probably should
consider doing more development at the interactive REPL prompt rather than
restarting
global X; X=x should probably be global const X=x and so on
On Sun, Nov 23, 2014 at 1:33 PM, Amit Murthy amit.mur...@gmail.com wrote:
I mentioned localize_vars() since it is one of the differences between
the implementations of @everywhere and @spawnat. But, there is something
else also
Hi
I am running a parallel matrix transpose using Julia. When I run it on a
small matrix with small number of workers, it works fine, but as I increase
the size and the number of workers, it starts giving MemoryError() and
Broken pipe signals.
I have put the error stacktrace here :
On Monday, November 24, 2014 1:07:59 PM UTC+10, Airhead Bit wrote:
Everything in a language I need but the examples at
http://julialang.org/learning/ like
Parallel Julia by Douglas Eadline in Admin magazine
Just blow up:
tic();
[...]
Please fix or remove broken examples, I've used
The article is quite old. Try randbool() instead of randbit(). Best to
remove such an old reference from the website.
-viral
On Monday, November 24, 2014 8:37:59 AM UTC+5:30, Airhead Bit wrote:
Everything in a language I need but the examples at
http://julialang.org/learning/ like
I made some progress on getting the code to run correctly in parallel while
using all the cores of one machine, by using pmap and running some prep
code on all the workers:
The next steps are to get this running on multiple machines (using
addprocs_ssh?) and then benchmarking. Here's the state
I don't think I am using that much memory. The following is my top result
PID USER PR NI VIRT RES SHR S %CPU %MEMTIME+ COMMAND
16290 kagarwal 20 0 1127m 100m 10m R 99.7 0.4 1:41.06 ptrans.jl
Regards,
Kapil Agarwal
On Sun, Nov 23, 2014 at 11:03 PM, Amit Murthy
Or just indicate that they are old and may be outdated.
On Sun, Nov 23, 2014 at 11:00 PM, Viral Shah vi...@mayin.org wrote:
The article is quite old. Try randbool() instead of randbit(). Best to
remove such an old reference from the website.
-viral
On Monday, November 24, 2014 8:37:59 AM
Two comments:
1) It's pretty easy to use MPI from Julia. For some use cases it may make
more sense than Julia's built-in approach to parallelism, especially if
you're already comfortable with MPI. Though if you're well served by pmap,
that's much simpler.
2) It looks like the subproblem
Are you using SharedArray or DArray?
-viral
On Monday, November 24, 2014 9:18:08 AM UTC+5:30, Kapil Agarwal wrote:
Hi
I am running a parallel matrix transpose using Julia. When I run it on a
small matrix with small number of workers, it works fine, but as I increase
the size and the
DArray
Here is the code as well
https://github.com/kapiliitr/JuliaBenchmarks/blob/master/ptrans.jl
Regards,
Kapil Agarwal
On Sun, Nov 23, 2014 at 11:22 PM, Viral Shah vi...@mayin.org wrote:
Are you using SharedArray or DArray?
-viral
On Monday, November 24, 2014 9:18:08 AM UTC+5:30,
1) It's pretty easy to use MPI from Julia. For some use cases it may make
more sense than Julia's built-in approach to parallelism, especially if
you're already comfortable with MPI. Though if you're well served by pmap,
that's much simpler.
Do you mean I should be able to broadcast and
What's your versioninfo?
I used Version 0.3.0 (x86_64-apple-darwin13.3.0) on a 2013 macbook which
took about 9.6 seconds to include the function, try to run it, and find the
syntax error. On a 2009 iMac with version 0.3.2 of Julia
(x86_64-apple-darwin14.0.0) it took 11.3 seconds.Just
Thank you very much. I think I will try your suggestion later this day.
Am Sonntag, 23. November 2014 21:27:22 UTC+1 schrieb Daniel Høegh:
This works:
ax = fig[:add_subplot](2,1,1, projection = 3d)
xgrid = repmat(x',n,1)
ygrid = repmat(y,1,n)
ax[:plot_surface](xgrid, ygrid, z,
In order to use a function of the ODE package, how to set the value
specified to the keyword points?
Hmmm. Version 0.3.2 will start up faster than 0.3.0, but neither should be
taking THAT long, I don't think. What does the following say for you:
*julia filter( x - contains(x, sys.dylib), Sys.dllist())*
*1-element Array{String,1}:*
* /usr/local/Cellar/julia/0.3.2/lib/julia/sys.dylib*
If you
60 matches
Mail list logo
