On Tuesday, 16 October 2018 at 21:12:39 UTC, welkam wrote:
On Tuesday, 16 October 2018 at 20:58:54 UTC, Jabari Zakiya
wrote:
And they could be modded to catch semantics like this and
produce faster code.
Its hard to prove that you will only write 1 or 0 in the array
and even if you write
On Tuesday, 16 October 2018 at 20:58:54 UTC, Jabari Zakiya wrote:
And they could be modded to catch semantics like this and
produce faster code.
Its hard to prove that you will only write 1 or 0 in the array
and even if you write such pass it wont fire very often. So
slower compile times for
On Tuesday, 16 October 2018 at 20:38:24 UTC, welkam wrote:
On Tuesday, 16 October 2018 at 17:57:23 UTC, Jabari Zakiya
wrote:
This is the exact same behavior I found with the Nim compiler
too.
Well Nim compiler is more like translator. It translates Nim
code to c or c++. Since gcc was
On Tuesday, 16 October 2018 at 17:57:23 UTC, Jabari Zakiya wrote:
This is the exact same behavior I found with the Nim compiler
too.
Well Nim compiler is more like translator. It translates Nim code
to c or c++. Since gcc was responsible for optimizations and
instruction selection it would
On Tuesday, 16 October 2018 at 07:09:05 UTC, Vijay Nayar wrote:
On Monday, 15 October 2018 at 22:17:57 UTC, Jabari Zakiya wrote:
$ dub build --compiler=ldc2 -b=release && echo "30" |
./twinprimes
Enter integer number:
threads = 8
each thread segment is [1 x 65536] bytes array
twinprime
On Tuesday, 16 October 2018 at 16:57:12 UTC, welkam wrote:
So I run profiler and 97% of time is spent in void twinsSieve
function and hotspots are seg[k] = seg[k] | 1; lines. Since
seg[k] can only be 1 or 0 I removed that or operation. And the
results are. Queue the drum-roll... 5% slower.
On Tuesday, 16 October 2018 at 07:09:05 UTC, Vijay Nayar wrote:
D has multiple compilers, but for the speed of the finished
binary, LDC2 is generally recommended. I used version 1.11.0.
https://github.com/ldc-developers/ldc/releases/tag/v1.11.0
I was using DUB to manage the project, but to
So I run profiler and 97% of time is spent in void twinsSieve
function and hotspots are seg[k] = seg[k] | 1; lines. Since
seg[k] can only be 1 or 0 I removed that or operation. And the
results are. Queue the drum-roll... 5% slower.
I thought that all of my studying was getting somewhere.
On Monday, 15 October 2018 at 22:17:57 UTC, Jabari Zakiya wrote:
$ dub build --compiler=ldc2 -b=release && echo "30" |
./twinprimes
Enter integer number:
threads = 8
each thread segment is [1 x 65536] bytes array
twinprime candidates = 175324676; resgroups = 1298702
each 135 threads has
$ dub build --compiler=ldc2 -b=release && echo "30" |
./twinprimes
Enter integer number:
threads = 8
each thread segment is [1 x 65536] bytes array
twinprime candidates = 175324676; resgroups = 1298702
each 135 threads has nextp[2 x 5566] array
setup time = 1 ms, 864 μs, and 7 hnsecs
I don't actually understand the underlying algorithm, but I at
least understand the flow of the program and the structure.
The algorithm utilized depends heavily on using shared memory
access, which can be done in D, but I definitely wouldn't call
it idiomatic. In D, message passing is
On Sunday, 14 October 2018 at 10:51:11 UTC, Vijay Nayar wrote:
Once I get the bugs out, I'm curious to see if any performance
differences crop up. There's the theory that says they should
be the same, and then there's the practice.
I don't actually understand the underlying algorithm, but I
On Sunday, 14 October 2018 at 10:51:11 UTC, Vijay Nayar wrote:
But as previous posters have said, the code is not really very
different between Nim and D. Most of it is array manipulation
and arithmetic operations, and not many of the features of
either D or Nim are very different. Both turn
On Saturday, 13 October 2018 at 19:04:48 UTC, Jabari Zakiya wrote:
On Saturday, 13 October 2018 at 18:31:57 UTC, Vijay Nayar wrote:
On Saturday, 13 October 2018 at 18:14:20 UTC, Vijay Nayar
wrote:
On Saturday, 13 October 2018 at 18:05:45 UTC, Jabari Zakiya
wrote:
It may be also running into
On Saturday, 13 October 2018 at 18:31:57 UTC, Vijay Nayar wrote:
On Saturday, 13 October 2018 at 18:14:20 UTC, Vijay Nayar wrote:
On Saturday, 13 October 2018 at 18:05:45 UTC, Jabari Zakiya
wrote:
It may be also running into a hard time limit imposed on
compilation that Nim had/has that
On Saturday, 13 October 2018 at 18:14:20 UTC, Vijay Nayar wrote:
On Saturday, 13 October 2018 at 18:05:45 UTC, Jabari Zakiya
wrote:
It may be also running into a hard time limit imposed on
compilation that Nim had/has that prevented my code from
initially compiling. I'm generating a lot of
On Saturday, 13 October 2018 at 18:14:20 UTC, Vijay Nayar wrote:
On Saturday, 13 October 2018 at 18:05:45 UTC, Jabari Zakiya
wrote:
It may be also running into a hard time limit imposed on
compilation that Nim had/has that prevented my code from
initially compiling. I'm generating a lot of
On Saturday, 13 October 2018 at 18:05:45 UTC, Jabari Zakiya wrote:
It may be also running into a hard time limit imposed on
compilation that Nim had/has that prevented my code from
initially compiling. I'm generating a lot of PG parameter
constants at compile time, and it's doing a lot of
On Saturday, 13 October 2018 at 17:36:33 UTC, Vijay Nayar wrote:
On Saturday, 13 October 2018 at 15:50:06 UTC, Vijay Nayar wrote:
On Saturday, 13 October 2018 at 15:19:07 UTC, Jabari Zakiya
wrote:
On Saturday, 13 October 2018 at 14:32:33 UTC, welkam wrote:
On Saturday, 13 October 2018 at
On Saturday, 13 October 2018 at 15:50:06 UTC, Vijay Nayar wrote:
On Saturday, 13 October 2018 at 15:19:07 UTC, Jabari Zakiya
wrote:
On Saturday, 13 October 2018 at 14:32:33 UTC, welkam wrote:
On Saturday, 13 October 2018 at 09:22:16 UTC, Vijay Nayar
wrote:
[...]
import algorithm
thats all
On Saturday, 13 October 2018 at 15:19:07 UTC, Jabari Zakiya wrote:
On Saturday, 13 October 2018 at 14:32:33 UTC, welkam wrote:
On Saturday, 13 October 2018 at 09:22:16 UTC, Vijay Nayar
wrote:
[...]
import algorithm
thats all but then it spits out
lib/nim/pure/algorithm.nim(144, 11) Error:
On Saturday, 13 October 2018 at 14:32:33 UTC, welkam wrote:
On Saturday, 13 October 2018 at 09:22:16 UTC, Vijay Nayar wrote:
I downloaded the reference NIM implementation and got the
latest nim compiler, but I received the following error:
$ nim c --cc:gcc --d:release --threads:on
On Saturday, 13 October 2018 at 14:32:33 UTC, welkam wrote:
On Saturday, 13 October 2018 at 09:22:16 UTC, Vijay Nayar wrote:
I downloaded the reference NIM implementation and got the
latest nim compiler, but I received the following error:
$ nim c --cc:gcc --d:release --threads:on
On Saturday, 13 October 2018 at 09:22:16 UTC, Vijay Nayar wrote:
I downloaded the reference NIM implementation and got the
latest nim compiler, but I received the following error:
$ nim c --cc:gcc --d:release --threads:on twinprimes_ssoz.nim
twinprimes_ssoz.nim(74, 11) Error: attempting
On Friday, 12 October 2018 at 21:08:03 UTC, Jabari Zakiya wrote:
On Friday, 12 October 2018 at 20:05:29 UTC, welkam wrote:
On Friday, 12 October 2018 at 16:19:59 UTC, Jabari Zakiya
wrote:
The real point of the challenge is too see what idiomatic
code...
There is no idiomatic D code. There is
On Friday, 12 October 2018 at 20:05:29 UTC, welkam wrote:
On Friday, 12 October 2018 at 16:19:59 UTC, Jabari Zakiya wrote:
The real point of the challenge is too see what idiomatic
code...
There is no idiomatic D code. There is only better
implementations.
D doesnt tell you how to write
On Friday, 12 October 2018 at 16:19:59 UTC, Jabari Zakiya wrote:
The real point of the challenge is too see what idiomatic
code...
There is no idiomatic D code. There is only better
implementations.
D doesnt tell you how to write your code. It gives you many tools
and you choose which
On Friday, 12 October 2018 at 16:19:59 UTC, Jabari Zakiya wrote:
Hmm,I don't think what you're saying about similar
output|performance with other languages is empirically correct,
but it's really not the point of the challenge.
Thats why godbolt exists.
c++ and Rust
On Friday, 12 October 2018 at 15:11:17 UTC, welkam wrote:
On Wednesday, 10 October 2018 at 16:15:56 UTC, Jabari Zakiya
wrote:
What I am requesting here is for a person(s) who is an
"expert" (very good) to create a very fast D version, using
whatever tricks it has to maximize performance.
I
On Wednesday, 10 October 2018 at 16:15:56 UTC, Jabari Zakiya
wrote:
What I am requesting here is for a person(s) who is an "expert"
(very good) to create a very fast D version, using whatever
tricks it has to maximize performance.
I would like to include in my paper a good comparison of
On 10/11/2018 10:14 AM, Jabari Zakiya wrote:
> Ok, hopefully this will work for everyone. Try this link:
>
> https://mega.nz/#!yJxUEQgK!MY9dwjiWheE8tACtEeS0szduIvdBjiyTn4O6mMD_aZw
Thank you. That worked just fine. I clicked the Download link and the
pdf was saved on my end. :)
Ali
On Thursday, 11 October 2018 at 16:13:17 UTC, Jabari Zakiya wrote:
On Thursday, 11 October 2018 at 14:49:54 UTC, Carl Sturtivant
wrote:
On Thursday, 11 October 2018 at 13:26:19 UTC, Jabari Zakiyth
wrote:
On Thursday, 11 October 2018 at 05:11:20 UTC, Ali Çehreli
wrote:
[...]
What country are
On Thursday, 11 October 2018 at 14:49:54 UTC, Carl Sturtivant
wrote:
On Thursday, 11 October 2018 at 13:26:19 UTC, Jabari Zakiyth
wrote:
On Thursday, 11 October 2018 at 05:11:20 UTC, Ali Çehreli
wrote:
[...]
What country are you trying to get access from, because I know
people in the US
On Thursday, 11 October 2018 at 13:26:19 UTC, Jabari Zakiyth
wrote:
On Thursday, 11 October 2018 at 05:11:20 UTC, Ali Çehreli wrote:
[...]
What country are you trying to get access from, because I know
people in the US have gotten the papers from those link, for
free and without an account.
On Thursday, 11 October 2018 at 05:11:20 UTC, Ali Çehreli wrote:
On 10/10/2018 07:52 PM, Jabari Zakiyth wrote:
> On Wednesday, 10 October 2018 at 22:25:17 UTC, Neia Neutuladh
wrote:
>> On 10/10/2018 03:05 PM, Jabari Zakiya wrote:
>>>
On 10/10/2018 07:52 PM, Jabari Zakiyth wrote:
> On Wednesday, 10 October 2018 at 22:25:17 UTC, Neia Neutuladh wrote:
>> On 10/10/2018 03:05 PM, Jabari Zakiya wrote:
>>> https://www.scribd.com/doc/228155369/The-Segmented-Sieve-of-Zakiya-SSoZ
>>
>> It would be great if you could provide a link to a
On Thursday, 11 October 2018 at 00:22:10 UTC, tide wrote:
On Wednesday, 10 October 2018 at 16:15:56 UTC, Jabari Zakiya
wrote:
I would like to include in my paper a good comparison of
various implementations in different compiled languages
(C/C++, D, Nim, etc) to show how it performs with each.
On Wednesday, 10 October 2018 at 22:25:17 UTC, Neia Neutuladh
wrote:
On 10/10/2018 03:05 PM, Jabari Zakiya wrote:
https://www.scribd.com/doc/228155369/The-Segmented-Sieve-of-Zakiya-SSoZ
It would be great if you could provide a link to a freely
downloadable version of this.
You can download
On Wednesday, 10 October 2018 at 16:15:56 UTC, Jabari Zakiya
wrote:
I would like to include in my paper a good comparison of
various implementations in different compiled languages (C/C++,
D, Nim, etc) to show how it performs with each.
If you want help with your paper, possibly some kind of
On 10/10/2018 03:05 PM, Jabari Zakiya wrote:
https://www.scribd.com/doc/228155369/The-Segmented-Sieve-of-Zakiya-SSoZ
It would be great if you could provide a link to a freely downloadable
version of this.
On Wednesday, 10 October 2018 at 20:43:01 UTC, Kagamin wrote:
On Wednesday, 10 October 2018 at 16:15:56 UTC, Jabari Zakiya
wrote:
https://gist.github.com/jzakiya/6c7e1868bd749a6b1add62e3e3b2341e
As i understand, main thread preallocates global memory and
tracks it, and other threads don't
On Wednesday, 10 October 2018 at 16:15:56 UTC, Jabari Zakiya
wrote:
https://gist.github.com/jzakiya/6c7e1868bd749a6b1add62e3e3b2341e
As i understand, main thread preallocates global memory and
tracks it, and other threads don't track it?
On Wednesday, 10 October 2018 at 16:15:56 UTC, Jabari Zakiya
wrote:
[...]
Looking forward to this :)
Hi.
I hope this is the right place to request this, if not please
tell me a better one.
I had looked at D, and played with it some circa 2010~2012, but
time and life took my priorities away. But I'm still interested
in learning different languages, but there are so many more now
it's hard
44 matches
Mail list logo
