From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,20e94ebefeef23df,start X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-05-29 22:03:05 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!newsfeed.cs.utexas.edu!geraldo.cc.utexas.edu!not-for-mail From: "Bobby D. Bryant" Newsgroups: comp.lang.ada Subject: SIMD w/ MMX or 3dnow! Date: Thu, 29 May 2003 22:55:17 -0600 Organization: dis- Message-ID: NNTP-Posting-Host: dial-87-12.ots.utexas.edu Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit X-Trace: geraldo.cc.utexas.edu 1054270545 11189 128.83.219.124 (30 May 2003 04:55:45 GMT) X-Complaints-To: abuse@utexas.edu NNTP-Posting-Date: Fri, 30 May 2003 04:55:45 +0000 (UTC) User-Agent: Pan/0.14.0 (I'm Being Nibbled to Death by Cats!) Xref: archiver1.google.com comp.lang.ada:38034 Date: 2003-05-29T22:55:17-06:00 List-Id: Has anyone tried speeding up fp multiplication by calling MMX or 3dnow! instructions from within an Ada program? I work with artificial neural networks and much of the signal propagation can be reduced to instances of multiplying a single fp number times all the fp numbers in an array and adding the result of each individual multiplication to a different accumulator variable for each number in the array. (I.e., an input value is multiplied against a slice of the weight matrix and the results are added to the values in the hidden layer.) Any benchmark results and/or example code would be appreciated. Thanks. -- Bobby Bryant Austin, Texas