Path: csiph.com!eternal-september.org!feeder.eternal-september.org!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: gah4 Newsgroups: comp.compilers Subject: Re: Algorithm Optimization Date: Wed, 16 Sep 2020 13:59:13 -0700 (PDT) Organization: Compilers Central Lines: 19 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <20-09-040@comp.compilers> References: <20-09-032@comp.compilers> <20-09-037@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="78105"; mail-complaints-to="abuse@iecc.com" Keywords: optimize Posted-Date: 16 Sep 2020 17:34:42 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com In-Reply-To: <20-09-037@comp.compilers> Xref: csiph.com comp.compilers:2611 On Wednesday, September 16, 2020 at 8:14:44 AM UTC-7, mwmar...@gmail.com wrote: (snip) > This approaches the issue more from a "I want to replace serial > algorithms with parallel algorithms." if I recall correctly so it may > not be exactly what you are looking for. That might make more sense. So, an algorithm that it mathematically equivalent, but not necessarily numerically equivalent. One of the more obvious is matrix multiplication, which seems so simple, but the traditional ones aren't so good. For one, they have poor cache performance on many machines. It takes just a little more than parallelizing the usual algorithm to get it right. Replace matrix inversion with LU decomposition?