By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
424,986 Members | 2,042 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 424,986 IT Pros & Developers. It's quick & easy.

Results Gatherer - design question

P: n/a
A question.

Suppose you have a process that runs millions of times. And after
everytime it runs it spits out some results, and array.
Everytime the spat out results are dumped into a results gatherer. The
results gatherer takes the results and UPDATES an internal computation.
The internal computation may yield an object of almost any type, a
double, an array, a matrix , a complex, a function etc etc. After the
process has run a million times the gatherer is queried for the result
of the internal computation,

What is the best way to design the Gatherer. Speed is crucial

Sep 18 '06 #1
Share this Question
Share on Google+
3 Replies


P: n/a

"Narinder" <na*************@googlemail.comwrote in message
news:11*********************@h48g2000cwc.googlegro ups.com...
>A question.

Suppose you have a process that runs millions of times. And after
everytime it runs it spits out some results, and array.
Everytime the spat out results are dumped into a results gatherer. The
results gatherer takes the results and UPDATES an internal computation.
The internal computation may yield an object of almost any type, a
double, an array, a matrix , a complex, a function etc etc. After the
process has run a million times the gatherer is queried for the result
of the internal computation,

What is the best way to design the Gatherer. Speed is crucial
This isn't a C++ language question, which is the topic of this newsgroup.
I'm not even sure where such a question might be answerable. Perhaps
comp.programming or something? The requirements are far too vague for
anyone to be able to give you a "best" answer, (or even a fairly good
suggestion, in my opinion).

-Howard

Sep 18 '06 #2

P: n/a
"Narinder" <na*************@googlemail.comwrote:
A question.

Suppose you have a process that runs millions of times. And after
everytime it runs it spits out some results, and array.
Everytime the spat out results are dumped into a results gatherer. The
results gatherer takes the results and UPDATES an internal computation.
The internal computation may yield an object of almost any type, a
double, an array, a matrix , a complex, a function etc etc. After the
process has run a million times the gatherer is queried for the result
of the internal computation,

What is the best way to design the Gatherer. Speed is crucial
One step at a time.

--
There are two things that simply cannot be doubted. Logic and our
ability to sense the world around us. Doubt those, and you no longer
have anyone to discuss it with, nor any ability to discuss it.
Sep 18 '06 #3

P: n/a
Narinder wrote:
Suppose you have a process that runs millions of times. And after
everytime it runs it spits out some results, and array.
Everytime the spat out results are dumped into a results gatherer. The
results gatherer takes the results and UPDATES an internal computation.
The internal computation may yield an object of almost any type, a
double, an array, a matrix , a complex, a function etc etc. After the
process has run a million times the gatherer is queried for the result
of the internal computation,
What is the best way to design the Gatherer. Speed is crucial
Use AJAX and WEB 2.0. It will never work, but at least you will be using the
buzzwords of the day.

--
Salu2
Sep 18 '06 #4

This discussion thread is closed

Replies have been disabled for this discussion.