State-Aware Concurrency Throttling

Daniele De Sensi*, Peter Kilpatrick, Massimo Torquati

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

Abstract

Reconfiguration of parallel applications has gained traction with the increasing emphasis on energy/performance trade-off. The ability to dynamically change the amount of resources used by an application allows reaction to changes in the environment, in the application behavior or in the user's requirements. A popular technique consists in changing the number of threads used by the application (Dynamic Concurrency Throttling). Although this provides good control of application performance and power consumption, managing the technique can impose a significant burden on the application programmer, mainly due to state management and redistribution following the addition or removal of a thread. Nevertheless, some common state access patterns have been identified in some popular applications. By leveraging on this knowledge, we will describe how it is possible to simplify the state management procedures following a Concurrency Throttling operation.

Original languageEnglish
Title of host publicationParallel Computing is Everywhere
PublisherIOS Press BV
Pages201-210
Number of pages10
Volume32
ISBN (Electronic)9781614998426
DOIs
Publication statusPublished - 01 Jan 2018

Publication series

NameAdvances in Parallel Computing
Volume32
ISSN (Print)0927-5452
ISSN (Electronic)1879-808X

Keywords

  • Concurrency Throttling
  • Data Stream Processing
  • Power-Aware Computing

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'State-Aware Concurrency Throttling'. Together they form a unique fingerprint.

  • Cite this

    De Sensi, D., Kilpatrick, P., & Torquati, M. (2018). State-Aware Concurrency Throttling. In Parallel Computing is Everywhere (Vol. 32, pp. 201-210). (Advances in Parallel Computing; Vol. 32). IOS Press BV. https://doi.org/10.3233/978-1-61499-843-3-201