| Related articles |
|---|
| 200 way issue? davidm@questor.rational.com (1993-09-29) |
| Re: 200 way issue? anton@mips.complang.tuwien.ac.at (1993-09-30) |
| Re: 200 way issue? pop@mtu.edu (1993-09-30) |
| Re: 200 way issue? grover@brahmand.Eng.Sun.COM (1993-09-30) |
| Re: 200 way issue? petersen@sp51.csrd.uiuc.edu (1993-09-30) |
| Re: 200 way issue? mac@coos.dartmouth.edu (1993-10-01) |
| Re: 200 way issue? preston@dawn.cs.rice.edu (1993-10-01) |
| Re: 200 way issue? daveg@thymus.synaptics.com (Dave Gillespie) (1993-10-04) |
| Newsgroups: | comp.compilers |
| From: | grover@brahmand.Eng.Sun.COM (Vinod Grover) |
| Keywords: | performance, bibliography |
| Organization: | Sun |
| References: | 93-09-142 |
| Date: | Thu, 30 Sep 1993 14:49:15 GMT |
davidm@questor.rational.com (David Moore) writes:
>Suppose, for example, we took the spec benchmarks and optimized for an
>infinite issue machine. Now suppose we built a histogram of actual number
>of instructions issued per machine cycle. Has anyone published a paper on
>what this histogram would look like?
See:
[1] Butler, Yeh, Patt, Alsup, Scales, Shebanow, "Single Instruction
Stream Parallelism is greater than 2", International Symp. on Comp.
Arch. 1991, ACM.
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.