Harnessing Parallelism in Multicore Systems to Expedite and Improve Function Approximation

Approximating functions in applications that can tolerate some inaccuracy in their results can deliver substantial performance gains. This paper makes a case for harnessing available parallelism in multicore systems to improve performance as well as the quality of function approximation. To that end...

Full description

Saved in:
Bibliographic Details
Published inLanguages and Compilers for Parallel Computing pp. 88 - 92
Main Authors Aurangzeb, Eigenmann, Rudolf
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Building History
High Output Variation
Multicore System
Online Training
Original Function
Online AccessGet full text

Cover

More Information
Summary:Approximating functions in applications that can tolerate some inaccuracy in their results can deliver substantial performance gains. This paper makes a case for harnessing available parallelism in multicore systems to improve performance as well as the quality of function approximation. To that end, we discuss a number of tasks that the function approximation schemes can offload to available parallel cores. We also discuss how leveraging parallelism can help provide guarantees about results and dynamically improve approximations. Finally, we present experimental results of a function approximation scheme.
ISBN:3319527088
9783319527086
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-52709-3_7