Scheduling in Heterogeneous Computing Environments for Proximity Queries

Provided by: Institute of Electrical & Electronic Engineers
Topic: Hardware
Format: PDF
The authors present a novel, Linear Programming (LP) based scheduling algorithm that exploits heterogeneous multi-core architectures such as CPUs and GPUs to accelerate a wide variety of proximity queries. To represent complicated performance relationships between heterogeneous architectures and different computations of proximity queries, they propose a simple, yet accurate model that measures the expected running time of these computations. Based on this model, they formulate an optimization problem that minimizes the largest time spent on computing resources, and propose a novel, iterative LP-based scheduling algorithm.

Find By Topic