Thanks for your interest. The users are welcome to make
improvements to the code and use in their research. Chapel, D and
Go are all relatively new languages and certainly many
optimizations are possible with them.
As shown in the paper, I ran the D code with "-inline -O
-release". I ran the
I am author of the paper "A Study of Successive Over-relaxation
Method Parallelization Over Modern HPC Languages".
The code has been made available for academic use at
https://www.academia.edu/9709444/Source_code_of_Parallel_and_Serial_Red-Black_SOR_Implementation_in_Chapel_D_and_Go_Languages
Qu
Thanks a lot. Sure, I post such questions on that forum.
Oh, I need to delete this thread, since there was an error. I did
not know how to edit, so I created another thread. My apologies.
Please delete it and read another one.
Hello
I read: "The total size of a static array cannot exceed 16Mb. A
dynamic array should be used instead for such large arrays."
I want to make array which is shared but also has a large size,
e.g.
shared WorkerClass[numberOfWorkers] myWorkerArray;
where numberOfWorkers is large.
I
Hello
I read: "The total size of a static array cannot exceed 16Mb. A
dynamic array should be used instead for such large arrays."
I want to make array which is shared but also has a large size,
e.g.
shared WorkerClass[numberOfWorkers] myWorkerArray;
where numberOfWorkers is large.
If I
I think the closest thing in D is a Fiber:
http://dlang.org/phobos/core_thread.html#Fiber
Ali
Thanks a lot. That was very helpful.
The real 1:1 OS thread. There was talk of using green threads
for std.concurrency but it's not happening in the near future.
Thanks for your reply and confirmation.
Would anyone also kindly answer the second question. Thanks.
In D's case, it depends. If you are making use of threading
APIs directly then you have 1:1 mapping to OS threads, but if
you use actors
or std.parallelism module, then you have a N:1 mapping between
tasks and OS threads.
Thanks a lot for your prompt reply.
I am using: std.concurrency and co
Hello
I could find this for Java, but not yet for D and so wanted to
ask:
Would you tell briefly, how multi-threading in D works on
hardware. What I wanted to ask is: if we have a single-core or
multicore system, how does scheduling of threads in D happens.
For Java, what I found was (in m
On Sunday, 18 November 2012 at 08:35:51 UTC, Philippe Sigaud
wrote:
I remember reading an article on graphs using D a few years
ago. Ah, there
it is:
http://www.massey.ac.nz/~kahawick/cstn/043/cstn-043.pdf
Thanks. That is very helpful.
To explain slightly more, I am a graduate student in Computer
Engg. I was looking for evaluation of D by
users/developers/real-world applications, something like this:
http://stackoverflow.com/questions/56315/d-programming-language-in-the-real-world,
but more scientific-oriented work.
On Saturday, 17 November 2012 at 22:42:57 UTC, bearophile wrote:
What kind of texts are you looking for?
For example, for Go language, I found, "GoHotDraw: Evaluating the
Go programming language with design patterns", where they have
evaluated use of Go for that project. Similarly, one can f
Hello
I was looking for research publications on D (either design of D
or its application) on Google scholar, but since searching D is
difficult, I could not find much.
I would be grateful if you could point me to a collection etc. of
papers on D. It will be very helpful in my research.
Tha
14 matches
Mail list logo
