Application code benchmark?

"Amit M. Rao" <arao@ececs.uc.edu>
24 Sep 1997 00:09:28 -0400

          From comp.compilers
Related articles
Application code benchmark? arao@ececs.uc.edu (Amit M. Rao) (1997-09-24)
| List of all articles for this month |
From: "Amit M. Rao" <arao@ececs.uc.edu>
Newsgroups: comp.compilers
Date: 24 Sep 1997 00:09:28 -0400
Organization: Dept. of ECECS, Univ. of Cincinnati
Keywords: benchmarks, question

hi,


I am looking for some standard code or a benchmark kernel which has the
following structure


for(i=0;i<LOOP;i++){
  c[i] = compute_intensive_task(i);
  A[i] = c[i]*A[i-5] + 10;
}


The restrictions are :
1) dependence has to be carried by outermost loop
2) dependence distance should be constant
3) Only one dependence vector




Thanks.


Amit


Work : Home :
---- ----
Graduate Student 506 Riddle Rd.,
Computer Engg. Apt # 25,
Dept. of ECECS Cincinnati, Oh 45220
Univ of Cincinnati, USA.
805C Rhodes Hall, Tel no :
(513)559-9413
Cincinnati, OH 45220
USA
email : arao@ececs.uc.edu
URL : http://www.ececs.uc.edu/~arao/
--

Post a followup to this message

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