Multi-core fixed priority DVS scheduling

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

Abstract

In this paper, we study offline and online DVS algorithms for Fixed Priority tasks scheduled on multi-core systems. The offline multi-core algorithm (MC-SSS) slows down tasks with a static slowdown speed based on multi-core fixed priority schedulability analysis. And the on-line algorithm (MC-ccFPP) combines load balancing algorithm and cycle conservative slack analysis to slow down tasks. Experimental results for random tasks set are shown and the analysis of the experimental results is provided. Performance analysis studies the energy saving for the offline multi-core algorithm (MC-SSS) and the online multi-core algorithm (MC-ccFPP) for a variety of task sets with different CPU utilization, different number of tasks and different number of cores. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Yang, L., Lin, M., & Yang, L. T. (2012). Multi-core fixed priority DVS scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7439 LNCS, pp. 517–530). https://doi.org/10.1007/978-3-642-33078-0_37

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