作者: Per Stenström , Peter Rundberg
DOI:
关键词:
摘要: We present a software approach to design thread-level data dependence speculation system targeting multiprocessors. Highly-tuned checking codes are associated with loads and stores whose addresses cannot be disambiguated by parallel compilers that can potentially cause violations at run-time. Besides resolving many name true dependencies through dynamic renaming forwarding, respectively, our method supports commit operations. Performance results collected on an architectural simulator validated commercial multi-processor show the overhead reduced less than ten instructions per speculative memory operation. Moreover, we demonstrate ten-fold speedup is possible some of difficult-to-parallelize loops in Perfect Club benchmark suite 16-way multiprocessor.