From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 17930 invoked by alias); 27 Jul 2007 05:04:48 -0000 Received: (qmail 17920 invoked by uid 22791); 27 Jul 2007 05:04:47 -0000 X-Spam-Check-By: sourceware.org Received: from wx-out-0506.google.com (HELO wx-out-0506.google.com) (66.249.82.235) by sourceware.org (qpsmtpd/0.31) with ESMTP; Fri, 27 Jul 2007 05:04:45 +0000 Received: by wx-out-0506.google.com with SMTP id i30so725508wxd for ; Thu, 26 Jul 2007 22:04:44 -0700 (PDT) Received: by 10.70.67.4 with SMTP id p4mr4360926wxa.1185512683968; Thu, 26 Jul 2007 22:04:43 -0700 (PDT) Received: by 10.70.89.10 with HTTP; Thu, 26 Jul 2007 22:04:43 -0700 (PDT) Message-ID: Date: Fri, 27 Jul 2007 05:04:00 -0000 From: Michael To: help-gsl@gnu.org, gsl-discuss@sources.redhat.com Subject: seeking highly efficient caches scheme for demanding engineering computing? MIME-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Content-Disposition: inline Mailing-List: contact gsl-discuss-help@sourceware.org; run by ezmlm Precedence: bulk List-Id: List-Subscribe: List-Archive: List-Post: List-Help: , Sender: gsl-discuss-owner@sourceware.org X-SW-Source: 2007-q3/txt/msg00014.txt.bz2 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!