Real-time scheduling on multicore platforms

15Citations
Citations of this article
102Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Multicore architectures, which have multiple processing units on a single chip, are widely viewed as a way to achieve higher processor performance, given that thermal and power problems impose limits on the performance of single-core designs. Accordingly, several chip manufacturers have already released, or will soon release, chips with dual cores, and it is predicted that chips with up to 32 cores will be available within a decade. To effectively use the available processing resources on multicore platforms, software designs should avoid co-executing applications or threads that can worsen the performance of shared caches, if not thrash them. While cache-aware scheduling techniques for such platforms have been proposed for throughput-oriented applications, to the best of our knowledge, no such work has targeted real-time applications. In this paper, we propose and evaluate a cache-aware Pfair-based scheduling scheme for real-time tasks on multicore platforms © 2006 IEEE.

Cite

CITATION STYLE

APA

Anderson, J. H., Calandrino, J. M., & Devi, U. C. (2006). Real-time scheduling on multicore platforms. In Real-Time Technology and Applications - Proceedings (pp. 179–190). https://doi.org/10.1109/RTAS.2006.35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free