Premium
Power‐aware pipelining with automatic concurrency control
Author(s) -
Torquati Massimo,
De Sensi Daniele,
Mencagli Gabriele,
Aldinucci Marco,
Danelutto Marco
Publication year - 2018
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.4652
Subject(s) - computer science , concurrency , concurrency control , multiversion concurrency control , blocking (statistics) , distributed computing , throughput , parallel computing , message queue , queue , concurrent data structure , optimistic concurrency control , power (physics) , computer network , distributed concurrency control , operating system , programming language , database transaction , wireless , physics , quantum mechanics
Summary Continuous streaming computations are usually composed of different modules, exchanging data through shared message queues. The selection of the algorithm used to access such queues (ie, the concurrency control ) is a critical aspect both for performance and power consumption. In this paper, we describe the design of automatic concurrency control algorithm for implementing power‐efficient communications on shared‐memory multicores. The algorithm automatically switches between nonblocking and blocking concurrency protocols, getting the best from the two worlds, ie, obtaining the same throughput offered by the nonblocking implementation and the same power efficiency of the blocking concurrency protocol. We demonstrate the effectiveness of our approach using two micro‐benchmarks and two real streaming applications.