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=-0.3 required=5.0 tests=BAYES_00,FREEMAIL_FROM, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,8c8550b9f2cf7d40 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-06-10 09:10:38 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!headwall.stanford.edu!newshub.sdsu.edu!elnk-pas-nf2!newsfeed.earthlink.net!newsfeed.news2me.com!small1.nntp.aus1.giganews.com!border1.nntp.aus1.giganews.com!intern1.nntp.aus1.giganews.com!nntp.giganews.com!nntp.gbronline.com!news.gbronline.com.POSTED!not-for-mail NNTP-Posting-Date: Tue, 10 Jun 2003 11:10:40 -0500 Date: Tue, 10 Jun 2003 11:11:10 -0500 From: Wesley Groleau Reply-To: wesgroleau@despammed.com Organization: Ain't no organization here! User-Agent: Mozilla/5.0 (Macintosh; U; PPC Mac OS X Mach-O; en-US; rv:1.3.1) Gecko/20030425 X-Accept-Language: en-us, en, es-mx, pt-br, fr-ca MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Is ther any sense in *= and matrices? References: <7visre2rwv.fsf@vlinux.voxelvision.no> In-Reply-To: <7visre2rwv.fsf@vlinux.voxelvision.no> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Message-ID: NNTP-Posting-Host: 216.117.18.98 X-Trace: sv3-B5d5tRRGVQX4nnVJpyDtmEz0WGSkjG9pP+GgcptykpF6n76kwRHR3V9TJX05B2Dg4f0cbEhY0vFjZXK!dlqBJr2VOYimWmxiYXPQOOMTXS5GWNVA3Oa8fkJxKYiCJyq/Inbkvz58rpGjqSE2pBy04ZgFx0te!U8Uj X-Complaints-To: abuse@gbronline.com X-DMCA-Complaints-To: abuse@gbronline.com X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly X-Postfilter: 1.1 Xref: archiver1.google.com comp.lang.ada:38907 Date: 2003-06-10T11:11:10-05:00 List-Id: > Yes, on modern hardware, having a pointer for each row of the matrix > usually leads to slower code. The reason is that the indexing > operation by multilply/add is actually faster than fetching a pointer > from an array and then adding, thereby incurring an extra memory fetch > and cache pollution. The above holds for large matrices, I haven't So Java's handling of arrays is inefficient for matrices, even if bypassing the JVM by compiling to native code?