arrow
Return

Adapting application execution in CMPs using helper threads

delete2009-09-01
delete7
PRE
AI
Y
Yang Ding *
M
Mahmut Kandemir
P
Padma Raghavan
M
M.J. Irwin
DOI:10.1016/j.jpdc.2009.04.004delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In parallel to the changes in both the architecture domain - the move toward chip multiprocessors (CMPs) - and the application domain - the move toward increasingly data-intensive workloads - issues such as performance, energy efficiency and CPU availability are becoming increasingly critical. The CPU availability can change dynamically due to several reasons such as thermal overload, increase in transient errors, or operating system scheduling. An important question in this context is how to adapt, in a CMP, the execution of a given application to CPU availability change at runtime. Our paper studies this problem, targeting the energy-delay product (EDP) as the main metric to optimize. We first discuss that, in adapting the application execution to the varying CPU availability, one needs to consider the number of CPUs to use, the number of application threads to accommodate and the voltage/frequency levels to employ (if the CMP has this capability). We then propose to use helper threads to adapt the application execution to CPU availability change in general with the goal of minimizing the EDP. The helper thread runs parallel to the application execution threads and tries to determine the ideal number of CPUs, threads and voltage/frequency levels to employ at any given point in execution. We illustrate this idea using four applications (Fast Fourier Transform, MultiGrid, LU decomposition and Conjugate Gradient) under different execution scenarios. The results collected through our experiments are very promising and indicate that significant EDP reductions are possible using helper threads. For example, we achieved up to 66.3%, 83.3%, 91.2%, and 94.2% savings in EDP when adjusting all the parameters properly in applications FFT, MG, LU, and CG, respectively. We also discuss how our approach can be extended to address multiprogrammed workloads. Published by Elsevier Inc.
Keywords:
Adaptive computing
Helper thread
EDP reduction
Runtime optimization
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Journal of Parallel and Distributed Computing cover
Journal of Parallel and Distributed Computing
IF:
4
Papers:
3.8K
Citations:
4.8K

Organization

P
pennsylvania commonwealth system of higher education (pcshe)
Scholars:
12.9W
Papers: 11.7W
Citations: 177
Cited Papers

Cited Papers

Negative thermal expansion of pure and doped graphene
err2017-01-01
err0
errOAAI
errSarita Mann; Ranjan Kumar; V. K. Jindal
errShare
errSave
Biological motion task performance predicts superior temporal sulcus activity
err2011-12-01
err0
PREAI
errJohn D. Herrington; Charlotte Nymberg; Robert T. Schultz
errShare
errSave
errShare
errSave
Improved draft reference genome for the Glassy-winged Sharpshooter (Homalodisca vitripennis), a vector for Pierce’s disease
err2021-07-20
err0
errOAAI
errCassandra L Ettinger; Frank J Byrne; Matthew A Collin; Derreck Carter-House; Linda L Walling; Peter W Atkinson; Rick A Redak; Jason E Stajich
errShare
errSave
Mesothelioma and asbestos fiber type. Evidence from lung tissue analyses
err1989-04-15
err0
errOAAI
errJ. C. McDonald; B. Armstrong; B. Case; D. Doell; W. T. E. McCaughey; A. D. McDonald; P. Sébastien
errShare
errSave
An ultra-low-power CMOS voltage-controlled ring oscillator for passive RFID tags
err2014-06-01
err0
PREAI
errPouya Kamalinejad; Kamyar Keikhosravy; Reza Molavi; Shahriar Mirabbasi; Victor C. M. Leung
errShare
errSave
researcher View more