Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!news.lightlink.com!news.iecc.com!lnews.iecc.com!nerds-end From: Nikolaos Kavvadias Newsgroups: comp.compilers Subject: Re: benchmarks for global value numbering Date: Wed, 26 Oct 2011 14:31:34 -0700 (PDT) Organization: Compilers Central Lines: 17 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <11-10-018@comp.compilers> References: <11-10-012@comp.compilers> NNTP-Posting-Host: lnews.iecc.com X-Trace: gal.iecc.com 1319670945 50141 64.57.183.34 (26 Oct 2011 23:15:45 GMT) X-Complaints-To: abuse@iecc.com NNTP-Posting-Date: Wed, 26 Oct 2011 23:15:45 +0000 (UTC) Keywords: analysis, performance Posted-Date: 26 Oct 2011 19:15:44 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: x330-a1.tempe.blueboxinc.net comp.compilers:300 Hi there > I was wondering what are good benchmarks for a global value numbering > optimization. I recall a technical report called "Optimizer Evaluation" by Preston Briggs. You could find this from around the web. This report is/was accompanied by a set of C benchmarks, with each one exercising a different compilation phase/aspect. Nowadays, the "OptimizerEval" benchmarks are part of the LLVM Multisource benchmark suite. Kind regards Nikolaos Kavvadias