Show simple item record  

dc.contributor.authorCleary, John G.
dc.contributor.authorLittin, Richard H.
dc.contributor.authorMcWha, David J.A.
dc.contributor.authorPearson, Murray W.
dc.date.accessioned2008-10-22T02:55:32Z
dc.date.available2008-10-22T02:55:32Z
dc.date.issued1997-11
dc.identifier.citationCleary, J.G., Littin, R.H., McWha, D.J.A. & Pearson, M.W. (1997). Constraints on parallelism beyond 10 instructions per cycle. (Working paper 97/27). Hamilton, New Zealand: University of Waikato, Department of Computer Science.en_US
dc.identifier.issn1170-487X
dc.identifier.urihttps://hdl.handle.net/10289/1123
dc.description.abstractThe problem of extracting Instruction Level Parallelism at levels of 10 instructions per clock and higher is considered. Two different architectures which use speculation on memory accesses to achieve this level of performance are reviewed. It is pointed out that while this form of speculation gives high potential parallelism it is necessary to retain execution state so that incorrect speculation can be detected and subsequently squashed. Simulation results show that the space to store such state is a critical resource in obtaining good speedup. To make good use of the space it is essential that state be stored efficiently and that it be retired as soon as possible. A number of techniques for extracting the best usage from the available state storage are introduced.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherComputer Science, University of Waikatoen_NZ
dc.relation.ispartofseriesComputer Science Working Papers
dc.subjectinstruction level parallelismen_US
dc.subjectspeculationen_US
dc.titleConstraints on parallelism beyond 10 instructions per cycleen_US
dc.typeWorking Paperen_US
uow.relation.series97/27
pubs.elements-id54713
pubs.place-of-publicationHamiltonen_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record