Using program branch probability for the thread parallelisation of branch divergence on the CUDA platform Online publication date: Tue, 22-May-2018
by Hong Yao; Huifang Deng; Caifeng Zou
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 11, No. 2, 2018
Abstract: Virtualisation environment can bring more flexibility for parallel optimisation. In view of this, we focus on the divergent branch problem within a SIMT architecture, where threads with branch divergence should be serially executed. Existing approaches are normally costly and not so satisfactory in vectorising these threads due to the constraints of private variables. However, on the other hand, these constraints can be released in a virtualised environment, because the private resources can be avoided putting in use directly by applications. For virtualised CUDA platforms, our approach can converge isomorphic threads into same redundant warps to eliminate divergence. We introduce the algorithms for the thread recombination models of binary branches, single branch and multiple branches respectively, and each number of redundant warps can be determined by a program branch probability. Without redesigning hardware needed, we obtained a load balance schema for parallelisation of divergent branch threads.
Online publication date: Tue, 22-May-2018
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com