Calculating an upper bound on the finishing time of a group of threads executing on a GPU: A preliminary case study
Ref: HURRAY-TR-070401 Publication Date: 23 to 25, Aug, 2010
Calculating an upper bound on the finishing time of a group of threads executing on a GPU: A preliminary case study
Ref: HURRAY-TR-070401 Publication Date: 23 to 25, Aug, 2010Abstract:
Graphics processor units (GPUs) today can be used for computations that go beyond graphics and such use can attain a performance that is orders of magnitude greater than a normal processor. The software executing on a graphics processor is composed of a set of (often thousands of) threads which operate on different parts of the data and thereby jointly compute a result which is delivered to another thread executing on the main processor. Hence the response time of a thread executing on the main processor is dependent on the finishing time of the execution of threads executing on the GPU. Therefore, we present a simple method for calculating an upper bound on the finishing time of threads executing on a GPU, in particular NVIDIA Fermi. Developing such a method is non- trivial because threads executing on a GPU share hardware resources at very fine granularity.
Gurulingesh Raravi
Björn AnderssonDocument:
View
Download16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2010).
Macau, Macau SAR (P.R.C.).
Record Date: 7, Jul, 2010