An energy and performance efficient DVFS scheme for irregular parallel divide-and-conquer algorithms on the intel SCC

Yu Liang Chou, Shaoshan Liu, Eui Young Chung, Jean Luc Gaudiot

Research output: Contribution to journalArticle

2 Citations (Scopus)


The divide-and-conquer paradigm can be used to express many computationally significant problems, but an important subset of these applications is inherently load-imbalanced. Load balancing is a challenge for irregular parallel divide-and-conquer algorithms and efficiently solving these applications will be a key requirement for future many-core systems. To address the load imbalance issue, instead of attempting to dynamically balancing the workloads, this paper proposes an energy and performance efficient Dynamic Voltage and Frequency Scaling (DVFS) scheduling scheme, which takes into account the load imbalance behavior exhibited by these applications. More specifically, we examine the core of the divide-and-conquer paradigm and determine that the base-case-reached point where recursion stops is a suitable place in a divide-and-conquer paradigm to apply the proposed DVFS scheme. To evaluate the proposed scheme, we implement four representative irregular parallel divide-and-conquer algorithms, tree traversal, quicksort, finding primes, and n-queens puzzle, on the Intel Single-chip Cloud Computer (SCC) many-core machine. We demonstrate that, on average, the proposed scheme can improve performance by 41% while reducing energy consumption by 36% compared to the baseline running the whole computation with the default frequency configuration (400MHz).

Original languageEnglish
Article number6489971
Pages (from-to)13-16
Number of pages4
JournalIEEE Computer Architecture Letters
Issue number1
Publication statusPublished - 2014 Jan 27


All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this