🚀 go-pugleaf

In article <C19wHr.GF3@news.cso.uiuc.edu> ercolessi@uimrl3.mrl.uiuc.edu (furio ercolessi) writes:

>This is probably too much to ask.  But I am wondering.  Maybe any one of
>us (users) could spend some time in putting together some "typical" code,
>containing a simplified version of the loops where our programs spend
>most of the time.  Staying within, say, 100 lines.  These "test cases" could 
>be posted on c.l.f. (and stored at some anon ftp site) and compiler developers 
>could have a look at them and perhaps improve the compilers.
>
>These typical loops could perhaps also be coded as self-contained
>benchmarks a-la-Linpack, inducing a bit of competitiveness :-), 
>helping us to understand better the strengths and weaknesses of the
>various architectures, but not necessarily so.
>
>Any comment?

You've just described the Livermore Loops.