Soft Real-Time Scheduling on Performance Asymmetric Multicore Platforms

Authors:
John M. Calandrino;Dan Baumberger;Tong Li;Scott Hahn;James H. Anderson
Affiliations:
The University of North Carolina at Chapel Hill, USA;Intel Corporation, USA;Intel Corporation, USA;Intel Corporation, USA;The University of North Carolina at Chapel Hill, USA
Venue:
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Year:
2007

Citing 0
Cited 7

Real-time synchronization on distributed architecture with Ada-2005

Proceedings of the 2008 ACM annual international conference on SIGAda annual international conference
Evaluation of multi-core scheduling mechanisms for heterogeneous processing architectures

Proceedings of the 18th International Workshop on Network and Operating Systems Support for Digital Audio and Video
Novel task migration framework on configurable heterogeneous MPSoC platforms

Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Multicore-aware hybrid code positioning to reduce worst-case execution time

Proceedings of the 2010 Workshop on Interaction between Compilers and Computer Architecture
Efficient task scheduling for hard real-time tasks in asymmetric multicore processors

ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Using DVFS and task scheduling algorithms for a hard real-time heterogeneous multicore processor environment

Proceedings of the 2013 workshop on Energy efficient high performance parallel and distributed computing
Energy-efficient task allocation techniques for asymmetric multiprocessor embedded systems

ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses an approach for supporting soft real-time periodic tasks in Linux on performance asymmetric multicore platforms (AMPs). Such architectures consist of a large number of processing units on one or several chips, where each processing unit is capable of executing the same instruction set at a different performance level. We discuss deficiencies of Linux in supporting periodic real-time tasks, particularly when cores are asymmetric, and how such deficiencies were overcome. We also investigate how to provide good performance for non-real-time tasks in the presence of a real-time workload. We show that this can be done by using deferrable servers to explicitly reserve a share of each core for non-real-time tasks. This allows non-real-time tasks to have priority over real-time tasks when doing so will not cause timing requirements to be violated, thus improving non-real-time response times. Experiments show that even small deferrable servers can have a dramatic impact on non-real-time task performance.