research-article

Swapping to reduce preemptions and migrations in EKG

Authors:

Geoffrey Nelissen,

Shelby Funk,

Joël Goossens,

Dragomir MilojevicAuthors Info & Claims

ACM SIGBED Review, Volume 8, Issue 3

Pages 36 - 39

https://doi.org/10.1145/2038617.2038625

Published: 01 September 2011 Publication History

Get Access

Abstract

EKG is a multiprocessor scheduling algorithm which is optimal for the schedule of real-time periodic tasks with implicit deadlines. It adheres to the deadline partitioning fair (DP-Fair) approach. However, it was shown in recent studies that the systematic execution of some tasks inherent in such approaches, significantly reduce the usability of this algorithm. Hence, we propose a swapping algorithm with the aim of reducing the number of preemptions and migrations incurred by EKG. This algorithm should enhance the practicality of EKG while keeping its optimality.

References

[1]

S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel, "Proportionate progress: A notion of fairness in resource allocation," Algorithmica, vol. 15, no. 6, pp. 600--625, 1996.

Digital Library

Google Scholar

[2]

J. H. Anderson and A. Srinivasan, "Early-release fair scheduling," in ECRTS 2000, 2000, pp. 35--43.

Digital Library

Google Scholar

[3]

D. Zhu, D. Mossé, and R. Melhem, "Multiple-resource periodic scheduling problem: how much fairness is necessary?" in RTSS '03, 2003, pp. 142--151.

Digital Library

Google Scholar

[4]

G. Levin, S. Funk, C. Sadowski, I. Pye, and S. Brandt, "DP-Fair: A simple model for understanding optimal multiprocessor scheduling," in ECRTS '10, July 2010, pp. 3--13.

Digital Library

Google Scholar

[5]

B. Andersson and E. Tovar, "Multiprocessor scheduling with few preemptions," RTCSA '06, pp. 322--334, 2006.

Digital Library

Google Scholar

[6]

H. Cho, B. Ravindran, and E. D. Jensen, "An optimal real-time scheduling algorithm for multiprocessors," in RTSS '06, 2006, pp. 101--110.

Digital Library

Google Scholar

[7]

T. Megel, R. Sirdey, and V. David, "Minimizing task preemptions and migrations in multiprocessor optimal real-time schedules," in RTSS '10, 2010, pp. 37--46.

Digital Library

Google Scholar

[8]

B. B. Brandenburg and J. H. Anderson, "On the implementation of global real-time schedulers," in RTSS '09, 2009, pp. 214--224.

Digital Library

Google Scholar

[9]

A. Bastoni, B. B. Brandenburg, and J. H. Anderson, "An empirical comparison of global, partitioned, and clustered multiprocessor edf schedulers," in RTSS '10, 2010, pp. 14--24.

Digital Library

Google Scholar

[10]

A. Bastoni, B. B. Brandenburg, and J. Anderson, "Is Semi-Partitioned Scheduling Practical?" in ECRTS '11, July 2011, to appear.

Digital Library

Google Scholar

Index Terms

Swapping to reduce preemptions and migrations in EKG
1. Computer systems organization
  1. Embedded and cyber-physical systems
  2. Real-time systems
2. Hardware
  1. Communication hardware, interfaces and storage
    1. Signal processing systems

Recommendations

Reducing Preemptions and Migrations in EKG
RTCSA '12: Proceedings of the 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

EKG is a multiprocessor scheduling algorithm which is optimal for the scheduling of real-time periodic tasks with implicit deadlines. It consists in a semi-partitioned algorithm which adheres to the deadline partitioning fair (DP-Fair) theory. It was ...
Minimizing total tardiness on parallel machines with preemptions

The basic scheduling problem we are dealing with in this paper is the following one. A set of jobs has to be scheduled on a set of parallel uniform machines. Each machine can handle at most one job at a time. Each job becomes available for processing at ...
Parallel Processor Scheduling with Limited Number of Preemptions

In this paper, we compare the makespan of preemptive and i-preemptive schedules where only a limited number i of preemptions is allowed. The problem is to schedule n independent jobs on m identical processors that operate in parallel. The objective is ...

Comments

Information & Contributors

Information

Published In

ACM SIGBED Review Volume 8, Issue 3

Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)

September 2011

45 pages

EISSN:1551-3688

DOI:10.1145/2038617

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 2011

Published in SIGBED Volume 8, Issue 3

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
45
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Index Terms

Recommendations

Reducing Preemptions and Migrations in EKG

Minimizing total tardiness on parallel machines with preemptions

Parallel Processor Scheduling with Limited Number of Preemptions

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations