Abstract
Computation resources provided by modern multi-core processors make it possible to exploit thread-level parallelism in a specu-lative mode. In the past twenty years, tens of thread-level speculation (TLS) systems have been proposed and demonstrated the performance potential of TLS. Limited by the performance over-head caused by dynamic data dependency detection, speculative threads are usually confirmed sequentially in most TLS systems, and the execution of a speculative task may be delayed due to the rollback of tasks before it, even if there is no data dependency among them. In this paper, submission buffer, an aggressive TLS mechanism, is proposed to eliminate the unnecessary waiting caused by rollback. To keep the mis-speculation rate of this aggressive mechanism be at a lower value, some dynamic schedule strategies are also discussed. Experimental results indicate that the execution time could be shortened effectively under the same mis-speculation rate, and the overall performance is improved accordingly.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
