Dynamic core partitioning for energy efficiency

@article{Ding2010DynamicCP,
  title={Dynamic core partitioning for energy efficiency},
  author={Yang Ding and Mahmut T. Kandemir and Mary Jane Irwin and Padma Raghavan},
  journal={2010 IEEE International Symposium on Parallel \& Distributed Processing, Workshops and Phd Forum (IPDPSW)},
  year={2010},
  pages={1-8},
  url={https://api.semanticscholar.org/CorpusID:14091264}
}
This work proposes and evaluates a dynamic (runtime) core partitioning scheme for CMPs that exploits application level information and dynamically partition available cores across competing applications during the course of execution.
View on IEEE
cse.psu.edu
1 Citation
Background Citations
1
Methods Citations
1

Figures and Tables from this paper

One Citation

Reliability-aware core partitioning in chip multiprocessors

35 References

A helper thread based EDP reduction scheme for adapting application execution in CMPs

This paper proposes to use helper threads to adapt the application execution to CPU availability change in general with the goal of minimizing the EDP, targeting the energy-delay product (EDP) as the main metric to optimize.

Prediction-Based Power-Performance Adaptation of Multithreaded Scientific Codes

A prediction model for identifying energy-efficient operating points of concurrency in well-tuned multithreaded scientific applications, and a runtime system which uses live program analysis to optimize applications dynamically are presented.

Scheduling threads for constructive cache sharing on CMPs

This is the first paper demonstrating the effectiveness of PDF on real benchmarks, providing a direct comparison between PDF and WS, revealing the limiting factors for PDF in practice, and presenting an approach for overcoming these factors.

The impact of resource partitioning on SMT processors

This study seeks to quantify the performance impact of resource partitioning policies in SMT machines, focusing on the execution portion of the pipeline, and finds that for storage resources, statically allocating an equal portion to each thread provides good performance, in part by avoiding starvation.

Global Multi-Threaded Instruction Scheduling

Gains are demonstrated for a dual-core CMP model running a variety of codes and the advantage of exploiting global scheduling for multithreaded architectures is demonstrated, and gains in a detailed comparison with the decoupled software pipelining (DSWP) multi-threading technique are presented.

Prediction models for multi-dimensional power-performance optimization on many cores

A multi-dimensional, online performance predictor is presented, which is deployed to address the problem of simultaneous runtime optimization of DVFS and DCT on multi-core systems and outperforms earlier solutions that adapt only DVFS or DCT, as well as one that sequentially applies DCT then DVFS.

An Adaptive OpenMP Loop Scheduler for Hyperthreaded SMPs

This work proposes a self-tuning OpenMP loop scheduler designed to react to behavior caused by inter-thread data locality, instruction mix and SMT-related load imbalance, and it is shown that this scheduler outperforms all other OpenMP schedulers.

Partitioning Multi-Threaded Processors with a Large Number of Threads

This paper explores the design choices of sharing, or of partitioning and distributing, the front end (instruction cache, instruction fetch, and dispatch), the execution units and associated state, as well as the L1 Dcache banks, in a clustered multi-threaded (CMT) processor.

Online power-performance adaptation of multithreaded programs using hardware event-based prediction

This work presents a user-level library framework for nearly optimal online adaptation of multithreaded codes for low-power, high-performance execution that uses fast, runtime performance prediction derived from hardware event-driven profiling, to select thread granularities that achieve nearly optimal energy-efficiency points.

Implementing a dynamic processor allocation policy for multiprogrammed parallel applications in the SolarisTM

This study demonstrates the feasibility of incorporating the LLPC strategy into an existing commercial operating system and parallelizing compiler and provides further evidence of the performance improvement that is possible using this dynamic allocation strategy.