* seeking highly efficient caches scheme for demanding engineering computing?
@ 2007-07-27 5:04 Michael
0 siblings, 0 replies; only message in thread
From: Michael @ 2007-07-27 5:04 UTC (permalink / raw)
To: help-gsl, gsl-discuss
Asking for my friend...
seeking highly efficient caches scheme for demanding engineering computing?
HI all,
To same the time of costly function evaluation, I want to explore the
possibility of caching.
Suppose in millions of calls to the function evaluation, there are some
computations, in which only a portion of the parameters change, others
remain the same as the parameters that are used in some other function
evaluations some time before. To save time, I can group the varying
parameters into sub-groups, and cache the results for later use. This needs
a highly efficient cache and a efficient organzation and look-up. Also, the
decision of whether a group of parameters has been seen before should be
based on data trunk in binary form, instead of decimal formats, so I can
compare memory data trunks directly using memory comparison.
Does anybody have good suggestions and pointers on this approach?
Thanks!
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2007-07-27 5:04 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2007-07-27 5:04 seeking highly efficient caches scheme for demanding engineering computing? Michael
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).