Show simple item record

Aggressive execution engines for surpassing single basic block execution.

dc.contributor.authorButler, Michael Gerarden_US
dc.contributor.advisorPatt, Yale N.en_US
dc.date.accessioned2014-02-24T16:16:49Z
dc.date.available2014-02-24T16:16:49Z
dc.date.issued1993en_US
dc.identifier.other(UMI)AAI9409647en_US
dc.identifier.urihttp://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9409647en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/103718
dc.description.abstractThe increasing density of VLSI circuits has motivated research into ways to utilize large area budgets to improve computational performance. One promising approach is the exploitation of instruction-level parallelism. This technique is effective only if the amount of instruction-level parallelism present in real applications warrants it, and hardware can be designed to exploit it without sacrificing aggressive cycle times. Early studies suggested that sufficient parallelism exists in numeric applications, and more recent research efforts have concluded that sufficient parallelism exists in real, non-scientific applications to justify processors that will execute more than two instructions per cycle. These studies indicate significant performance improvements are possible using aggressive hardware designs today. Furthermore, they offer the possibility for substantial future gains from exploiting instruction-level parallelism using new microarchitectural models. This dissertation explores instruction-level parallelism and microarchitectural mechanisms to efficiently exploit it beyond what is currently thought to be available. The contributions of this dissertation include an extensive investigation into the availability of instruction-level parallelism, new techniques for exploiting the available parallelism, and insight into simulation methodologies. Preliminary trace-driven investigations demonstrate that a significant amount of parallelism is available for exploitation if the machine is designed to provide sufficient fetch bandwidth and high branch prediction accuracy. Experimental results indicate that dynamic scheduling provides a critical tolerance of imperfect memory hierarchies, but most dynamic selection mechanisms and instruction buffer organizations are adequate. In addition, an aggressive state maintenance mechanism provides a modest but consistent performance advantage. More aggressive hardware-based branch handling techniques provide modest performance improvements at significant hardware costs. These techniques demonstrate that further performance increases can be expected, but suggest that compiler support is required to reduce the hardware costs.en_US
dc.format.extent149 p.en_US
dc.subjectComputer Scienceen_US
dc.titleAggressive execution engines for surpassing single basic block execution.en_US
dc.typeThesisen_US
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineComputer Science and Engineeringen_US
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studiesen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/103718/1/9409647.pdf
dc.description.filedescriptionDescription of 9409647.pdf : Restricted to UM users only.en_US
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.