Results Gatherer - design question

[Narinder]

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

 

[Howard]

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

 

[Daniel T.]

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.

 

[=?ISO-8859-15?Q?Juli=E1n?= Albo]

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.