Abstract
Thread decomposition is critical for pipelined multithreading (PMT) to gain higher performance on target multi-core processors. This paper presents an automatic thread decomposition approach, which maps the decomposition problem onto a graph-theoretic framework to construct an optimised directed acyclic graph (DAG) with minimal bottleneck node size and balanced node size. In this approach, control dependence is treated as special data dependence and then an effective approach is proposed to remove redundant control dependences. A weighted DAG is constructed by assigning appropriate weights to all nodes and all dependences according to profile information. An automatic thread decomposition algorithm is given to generate an optimised pipeline based on the weighted DAG. The algorithm has been evaluated on a commodity multi-core processor, and experimental results show that it has achieved speedup ranging from 113% to 174% on some SPEC CPU 2000 benchmark programs.
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 callMore From: International Journal of High Performance Computing and Networking
Disclaimer: 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.
