Exploiting Instruction-Level Parallelism for Memory System Performance

Simple item page
dc.citation.bibtexNamephdthesisen_US
dc.citation.journalTitlePh.D. Thesisen_US
dc.citation.locationHouston, TXen_US
dc.contributor.orgCITI (http://citi.rice.edu/)en_US
dc.creatorPai, Vijay S.
dc.date.accessioned2007-10-31T00:57:25Z
dc.date.available2007-10-31T00:57:25Z
dc.date.issued2000-08-20
dc.date.modified2003-07-12en_US
dc.date.submitted2002-03-20en_US
dc.descriptionPhD Thesisen_US
dc.description.abstractCurrent microprocessors improve performance by exploiting instruction-level parallelism (ILP). ILP hardware techniques such as multiple instruction issue, out-of-order (dynamic) issue, and non-blocking reads can accelerate both computation and data memory references. Since computation speeds have been improving faster than data memory access times, memory system performance is quickly becoming the primary obstacle to achieving high performance. This dissertation focuses on exploiting ILP techniques to improve memory system performance. This dissertation includes both an analysis of ILP memory system performance and optimizations developed using the insights of this analysis. First, this dissertation shows that ILP hardware techniques, used in isolation, are often unsuccessful at improving memory system performance because they fail to extract parallelism among data reads that miss in the processor's caches. The previously-studied latency-tolerance technique of software prefetching provides some improvement by initiating data read misses earlier, but also suffers from limitations caused by exposed startup latencies, excessive fetch-ahead distances, and references that are hard to prefetch. This dissertation then uses the above insights to develop compile-time software transformations that improve memory system parallelism and performance. These transformations improve the effectiveness of ILP hardware, reducing exposed latency by over 80% for a latency-detection microbenchmark and reducing execution time an average of 25% across 14 multiprocessor and uniprocessor cases studied in simulation and an average of 21% across 12 cases on a real system. These transformations also combine with software prefetching to address key limitations in either latency-tolerance technique alone, providing the best performance when both techniques are combined for most of the uniprocessor and multiprocessor codes that we study. Finally, this dissertation also explores appropriate evaluation methodologies for ILP shared-memory multiprocessors. Memory system parallelism is a key feature determining ILP performance, but is neglected in previous-generation fast simulators. This dissertation highlights the errors possible in such simulators and presents new evaluation methodologies to improve the tradeoff between accuracy and evaluation speed.en_US
dc.identifier.citation "Exploiting Instruction-Level Parallelism for Memory System Performance," <i>Ph.D. Thesis,</i> 2000.
dc.identifier.urihttps://hdl.handle.net/1911/20185
dc.language.isoeng
dc.subjectmemory parallelism*
dc.subjectcompiler transformations*
dc.subjectperformance evaluation*
dc.subjectshared-memory multiprocessors*
dc.subject.keywordmemory parallelismen_US
dc.subject.keywordcompiler transformationsen_US
dc.subject.keywordperformance evaluationen_US
dc.subject.keywordshared-memory multiprocessorsen_US
dc.titleExploiting Instruction-Level Parallelism for Memory System Performanceen_US
dc.typeThesis
dc.type.dcmiText
thesis.degree.levelDoctoral
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Pai2000Aug3Exploiting.PDF
Size:
654 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications