Faster makespan estimation for GPU threads on a single streaming multiprocessor
Faster makespan estimation for GPU threads on a single streaming multiprocessor
复制标题
在单个流式多处理器上更快地估计 GPU 线程的完工时间
DOI：
10.1109/etfa.2013.6647966
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Stefan M. Petters
中科院分区：
文献类型：
--
作者：
Kostiantyn Berezovskyi;Konstantinos Bletsas;Stefan M. Petters
图形处理单元（GPU）被广泛用于减少CPU上的负载并释放给定计算机系统的其他资源。最近的趋势，利用GPU在嵌入式系统中需要的时间分析技术的发展，找到联合最坏情况下的执行时间为一组GPU线程的相同的并行应用程序，在流式多处理器。用于计算在单个流式多处理器上运行的GPU线程的确切最大完工时间的最新方法在计算上是昂贵的，并且即使是悲观近似通常也需要很长时间才能完成。因此，我们开发了一种技术，找到一个估计的最大完工时间使用元分析。它的简单性，灵活性和大规模并行化的能力，决定了软实时系统的使用潜力。
Graphics Processing Units (GPUs) are widely used to reduce the load on CPUs and liberate other resources of a given computer system. The recent trend of utilizing GPUs in embedded systems necessitates the development of timing analysis techniques for finding the joint worst-case execution time for a group of GPU threads of the same parallel application, on a streaming multiprocessor. The state-of-the-art approaches for computing the exact maximum makespan of GPU threads running on a single streaming multiprocessor are computationally expensive and even pessimistic approximations usually take a long time to complete. We therefore develop a technique for finding an estimate of the maximum makespan using metaheuristics. Its simplicity, flexibility and ability for massive parallelization, determine a potential of usage for soft real-time systems.