Re: Algorithm Optimization

gah4 <gah4@u.washington.edu>
Wed, 16 Sep 2020 13:59:13 -0700 (PDT)

          From comp.compilers
Related articles
[2 earlier articles]
Re: Algorithm Optimization rick.c.hodgin@gmail.com (Rick C. Hodgin) (2020-09-15)
Re: Algorithm Optimization derek@_NOSPAM_knosof.co.uk (Derek M. Jones) (2020-09-15)
Re: Algorithm Optimization gah4@u.washington.edu (gah4) (2020-09-15)
Re: Algorithm Optimization mwmarkland@gmail.com (mwmarkland@gmail.com) (2020-09-16)
Re: Algorithm Optimization rick.c.hodgin@gmail.com (Rick C. Hodgin) (2020-09-16)
Re: Algorithm Optimization derek@_NOSPAM_knosof.co.uk (Derek M. Jones) (2020-09-16)
Re: Algorithm Optimization gah4@u.washington.edu (gah4) (2020-09-16)
Re: Algorithm Optimization richard.nospam@gmail.com (Richard Harnden) (2020-09-16)
Re: Algorithm Optimization DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-09-17)
Re: Algorithm Optimization tkoenig@netcologne.de (Thomas Koenig) (2020-09-17)
Re: Algorithm Optimization minforth@arcor.de (A. K.) (2020-09-21)
Re: Algorithm Optimization DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-12-13)
Re: Algorithm Optimization gah4@u.washington.edu (gah4) (2020-12-20)
[1 later articles]
| List of all articles for this month |
From: gah4 <gah4@u.washington.edu>
Newsgroups: comp.compilers
Date: Wed, 16 Sep 2020 13:59:13 -0700 (PDT)
Organization: Compilers Central
References: 20-09-032 20-09-037
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
In-Reply-To: 20-09-037

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?

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.