|200 way issue? firstname.lastname@example.org (1993-09-29)|
|Re: 200 way issue? email@example.com (1993-09-30)|
|Re: 200 way issue? firstname.lastname@example.org (1993-09-30)|
|Re: 200 way issue? grover@brahmand.Eng.Sun.COM (1993-09-30)|
|Re: 200 way issue? email@example.com (1993-09-30)|
|Re: 200 way issue? firstname.lastname@example.org (1993-10-01)|
|Re: 200 way issue? email@example.com (1993-10-01)|
|Re: 200 way issue? firstname.lastname@example.org (Dave Gillespie) (1993-10-04)|
|From:||grover@brahmand.Eng.Sun.COM (Vinod Grover)|
|Date:||Thu, 30 Sep 1993 14:49:15 GMT|
email@example.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?
 Butler, Yeh, Patt, Alsup, Scales, Shebanow, "Single Instruction
Stream Parallelism is greater than 2", International Symp. on Comp.
Arch. 1991, ACM.
Return to the
Search the comp.compilers archives again.