Looking for benchmarks/code with balanced branches

Mayan Moudgill <moudgill@cs.cornell.EDU>
Sat, 23 Jan 1993 06:31:26 GMT

          From comp.compilers
Related articles
Looking for benchmarks/code with balanced branches moudgill@cs.cornell.EDU (Mayan Moudgill) (1993-01-23)
| List of all articles for this month |
Newsgroups: comp.compilers
From: Mayan Moudgill <moudgill@cs.cornell.EDU>
Organization: Cornell Univ. CS Dept, Ithaca NY 14853
Date: Sat, 23 Jan 1993 06:31:26 GMT
Keywords: optimize, question

I've been wondering what percentage of all branches are roughly balanced
i.e. are taken no more than say 75% of the time, but are taken at least
25% of the time. What are good references for this?


Also, has anybody got code that contains large numbers of these branches?


:)
Mayan
(moudgill@cs.cornell.edu)
--

Post a followup to this message

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