|
David1987 wrote: adding to a linked list is not an atomic operation.
Neither is any operation on a BigInteger!
Luc Pattyn [Forum Guidelines] [My Articles] Nil Volentibus Arduum
Please use <PRE> tags for code snippets, they preserve indentation, improve readability, and make me actually look at the code.
|
|
|
|
|
Aghhh! That explains it and crap.
|
|
|
|
|
Indeed, I didn't see any problems with that though, the bigint is a local variable..
|
|
|
|
|
locals are fine; however when there is one BigInteger, there is bound to be more, and the code looked rather abstract and incomplete, so I mentioned it just in case it would ring a bell.
Luc Pattyn [Forum Guidelines] [My Articles] Nil Volentibus Arduum
Please use <PRE> tags for code snippets, they preserve indentation, improve readability, and make me actually look at the code.
|
|
|
|
|
Yep, it's the add to the collection that's causing the problem. I'm guessing this is a vast oversimplification because what's posted there is not worth parallelising anyway.
Assuming the stuff inside the loop (calculating what's to be put in the list) is the expensive part, have a thread-local list (a local variable to the lambda) and merge them all at the end.
If it's actually adding millions of simple things to a list then you'll need to be cleverer about how you put things in there, for example creating an array large enough for everything beforehand and interleaving the results into well defined indices so they can't collide.
|
|
|
|
|
BobJanova wrote: creating an array large enough for everything beforehand and interleaving the results into well defined indices so they can't collide
I had never thought of that before. 
|
|
|
|
|
BobJanova wrote: If it's actually adding millions of simple things to a list
It is, but it's all done inside a while loop that I didn't show. However, my inner array grows by an order of 4*3^(n-1) for each while loop and goes on for a while (pardon the pun).
|
|
|
|
|
if your loop iterations have data dependencies (e.g. you are trying to calculate the overall sum in one accumulator), then parallellized code would require synchronization, which could throw away most if not all of your potential performance gains.
The normal way to efficiently calculate an overall sum would be to have explicit threads, each thread holding its own accumulator, summing the data entrusted on it; then in a sequential way adding all accumulators together.
As always, simple solutions only work well in simple situations...
Luc Pattyn [Forum Guidelines] [My Articles] Nil Volentibus Arduum
Please use <PRE> tags for code snippets, they preserve indentation, improve readability, and make me actually look at the code.
|
|
|
|
|
No summing involved. Just some computations to see if the data gets added to the list or not. Each loop could work independently since they don't really depend on one another, but they all add to the same LinkedList using AddLast.
|
|
|
|
|
Collections (and most every other kind of objects) aren't thread safe by themselves. You may consider having a thread-local list-of-things-to-add-later, fill those in parallel, then add them in sequentially. And if that is the majority of the work, parallellizing won't help you a bit.
Luc Pattyn [Forum Guidelines] [My Articles] Nil Volentibus Arduum
Please use <PRE> tags for code snippets, they preserve indentation, improve readability, and make me actually look at the code.
|
|
|
|
|
Thanks, but it is the majority of the work. 
|
|
|
|
|
|
Cool, I'll look into that. Thanks!
|
|
|
|
|
Hi,
I'm trying to create a function that gets 2 numbers and returns
a random number between those two number.
help please
|
|
|
|
|
The simplest answer is to look at the System.Random class.
Wrap one in a class and provide the method you need.
|
|
|
|
|
you are to kind: you also could tell him to use the feature "object browser" with the "random" keyword
I cannot remember: What did I before google?
|
|
|
|
|
He may have tried that with "rundom". 
I expect he'll be back asking why it keeps giving the same value over and over.
|
|
|
|
|
you're an optimist. I think there is no running code yet.
Luc Pattyn [Forum Guidelines] [My Articles] Nil Volentibus Arduum
Please use <PRE> tags for code snippets, they preserve indentation, improve readability, and make me actually look at the code.
|
|
|
|
|
All can be worked out with a little bit of Google-fu. Type one thing in, 2 clicks and I got this[^]. Weak in the way of the Google are you.
|
|
|
|
|
I don't want to use the random class.
i want to ceate this by my own.
|
|
|
|
|
Don't you think you should have stated that in your original question then? We don't read minds.
|
|
|
|
|
Try this:
Simple Random Number Generation[^]
And, as Peter said, why did you not say this in the original post since it would avoid people telling you to look it up in help.
Regards
David R
---------------------------------------------------------------
"Every program eventually becomes rococo, and then rubble." - Alan Perlis
The only valid measurement of code quality: WTFs/minute.
|
|
|
|
|
treuveni wrote: I don't want to use the random class.
i want to ceate this by my own
Well why didn't you f*ckin say that in your original message? How are we supposed to read your simple little mind when it generates almost no electrical energy on its own?
".45 ACP - because shooting twice is just silly" - JSOP, 2010
-----
You can never have too much ammo - unless you're swimming, or on fire. - JSOP, 2010
-----
"Why don't you tie a kerosene-soaked rag around your ankles so the ants won't climb up and eat your candy ass." - Dale Earnhardt, 1997
|
|
|
|
|
John Simmons / outlaw programmer wrote: Well why didn't you f*ckin say that in your original message? How are we
supposed to read your simple little mind when it generates almost no electrical
energy on its own?
f*ck you
|
|
|
|
|
public int GetRandomNumber()
{
return 3;
}
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
