完整後設資料紀錄
DC 欄位語言
dc.contributor.authorNatarajan, Ragavendraen_US
dc.contributor.authorMekkat, Vineethen_US
dc.contributor.authorHsu, Wei-Chungen_US
dc.contributor.authorZhai, Antoniaen_US
dc.date.accessioned2014-12-08T15:23:44Z-
dc.date.available2014-12-08T15:23:44Z-
dc.date.issued2012-04-01en_US
dc.identifier.issn0218-1266en_US
dc.identifier.urihttp://dx.doi.org/1240006en_US
dc.identifier.urihttp://hdl.handle.net/11536/16549-
dc.description.abstractFor today's increasingly power-constrained multicore systems, integrating simpler and more energy-efficient in-order cores becomes attractive. However, since in-order processors lack complex hardware support for tolerating long-latency memory accesses, developing compiler technologies to hide such latencies becomes critical. Compiler-directed prefetching has been demonstrated effective on some applications. On the application side, a large class of data centric applications has emerged to explore the underlying properties of the explosively growing data. These applications, in contrast to traditional benchmarks, are characterized by substantial thread-level parallelism, complex and unpredictable control flow, as well as intensive and irregular memory access patterns. These applications are expected to be the dominating workloads on future microprocessors. Thus, in this paper, we investigated the effectiveness of compiler-directed prefetching on data mining applications in in-order multicore systems. Our study reveals that although properly inserted prefetch instructions can often effectively reduce memory access latencies for data mining applications, the compiler is not always able to exploit this potential. Compiler-directed prefetching can become inefficient in the presence of complex control flow and memory access patterns; and architecture dependent behaviors. The integration of multithreaded execution onto a single die makes it even more difficult for the compiler to insert prefetch instructions, since optimizations that are effective for single-threaded execution may or may not be effective in multithreaded execution. Thus, compiler-directed prefetching must be judiciously deployed to avoid creating performance bottlenecks that otherwise do not exist. Our experiences suggest that dynamic performance tuning techniques that adjust to the behaviors of a program can potentially facilitate the deployment of aggressive optimizations in data mining applications.en_US
dc.language.isoen_USen_US
dc.subjectMulticoreen_US
dc.subjectdata miningen_US
dc.subjectprefetchingen_US
dc.subjectcompilersen_US
dc.subjectoptimizationen_US
dc.titleEFFECTIVENESS OF COMPILER-DIRECTED PREFETCHING ON DATA MINING BENCHMARKSen_US
dc.typeArticleen_US
dc.identifier.doi1240006en_US
dc.identifier.journalJOURNAL OF CIRCUITS SYSTEMS AND COMPUTERSen_US
dc.citation.volume21en_US
dc.citation.issue2en_US
dc.citation.epageen_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.identifier.wosnumberWOS:000305249100007-
dc.citation.woscount0-
顯示於類別:期刊論文