Repository landing page
A domain specific approach to high performance heterogeneous computing
Abstract
Users of heterogeneous computing systems face two problems: first, in understanding the trade-off relationships between the observable characteristics of their applications, such as latency and quality of the result, and second, how to exploit knowledge of these characteristics to allocate work to distributed computing platforms efficiently. A domain specific approach addresses both of these problems. By considering a subset of operations or functions, models of the observable characteristics or domain metrics may be formulated in advance, and populated at run-time for task instances. These metric models can then be used to express the allocation of work as a constrained integer program. These claims are illustrated using the domain of derivatives pricing in computational finance, with the domain metrics of workload latency and pricing accuracy. For a large, varied workload of 128 Black-Scholes and Heston model-based option pricing tasks, running upon a diverse array of 16 Multicore CPUs, GPUs and FPGAs platforms, predictions made by models of both the makespan and accuracy are generally within 10 percent of the run-time performance. When these models are used as inputs to machine learning and MILP-based workload allocation approaches, a latency improvement of up to 24 and 270 times over the heuristic approach is seen- Journal Article
- Science & Technology
- Technology
- Computer Science, Theory & Methods
- Engineering, Electrical & Electronic
- Computer Science
- Engineering
- Distributed computing
- programming environments
- accelerator architectures
- high performance computing
- application software
- INDEPENDENT TASKS
- ALLOCATION
- 0803 Computer Software
- 0805 Distributed Computing
- 1005 Communications Technologies
- Distributed Computing