Transparent application acceleration by intelligent scheduling of shared library calls on heterogeneous systems

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Transparent application acceleration in heterogeneous systems can be performed by automatically intercepting shared libraries calls and by efficiently orchestrating the execution across all processing devices. To fully exploit the available computing power, the intercepted calls must be replaced with faster accelerator-based implementations and intelligent scheduling algorithms must be incorporated. When compared with previous approaches, the framework herein proposed does not only transparently intercepts and redirects the library calls, but it also incorporates state-of-art scheduling algorithms, for both divisible and indivisible applications. When compared with highly optimized implementations for multi-core CPUs (e.g., MKL and FFTW), the obtained experimental results demonstrate that, by applying appropriate light-weight scheduling and load-balancing mechanisms, performance speedups as high as 7.86 (matrix multiplication) and 4.6 (FFT) can be achieved. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Colaço, J., Matoga, A., Ilic, A., Roma, N., Tomás, P., & Chaves, R. (2014). Transparent application acceleration by intelligent scheduling of shared library calls on heterogeneous systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8384 LNCS, pp. 693–703). Springer Verlag. https://doi.org/10.1007/978-3-642-55224-3_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free