Unveiling the performance‐energy trade‐off in iterative linear system solvers for multithreaded processors. (9th September 2014)

• Record Type: Journal Article
• Authors: Aliaga, José I.; Anzt, Hartwig; Castillo, Maribel; Fernández, Juan C.; León, Germán; Pérez, Joaquín; Quintana‐Ortí, Enrique S.; Hussain, Farookh Khadeer; Wyrzykowski, Roman; Tudruj, Marek
• Is Part Of: Concurrency and computation. Volume 27:Number 4(2015:Mar.)
• Page Start: 885
• Page End: 904
• Publication Date: 2014-09-09
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3341
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3341-abs-0001"> <title>Summary</title> <p id="cpe3341-para-0001">In this paper, we analyze the interactions occurring in the triangle performance‐power‐energy for the execution of a pivotal numerical algorithm, the iterative conjugate gradient (CG) method, on a diverse collection of parallel multithreaded architectures. This analysis is especially timely in a decade where the power wall has arisen as a major obstacle to build faster processors. Moreover, the CG method has recently been proposed as a complement to the LINPACK benchmark, as this iterative method is argued to be more archetypical of the performance of today's scientific and engineering applications. To gain insights about the benefits of hands‐on optimizations we include runtime and energy efficiency results for both out‐of‐the‐box usage relying exclusively on compiler optimizations, and implementations manually optimized for target architectures, that range from general‐purpose and digital signal multicore processors to manycore graphics processing units, all representative of current multithreaded systems. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>