Multiprocessor Scheduling with Few Preemptions

Authors:
Bjorn Andersson;Eduardo Tovar
Affiliations:
Polytechnic Institute of Porto, Portugal;Polytechnic Institute of Porto, Portugal
Venue:
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2006

Citing 0
Cited 24

Portioned EDF-based scheduling on multiprocessors

EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Optimal virtual cluster-based multiprocessor scheduling

Real-Time Systems
Optimal RM scheduling for simply periodic tasks on uniform multiprocessors

Proceedings of the 2009 International Conference on Hybrid Information Technology
Fixed-priority scheduling on prioritized SMT processor

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Real-time static voltage scaling on multiprocessors

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Optimal real-time scheduling for efficient aperiodic services on multiprocessors

PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
Soft real-time scheduling with tardiness bounds on prioritized SMT processors

PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
Multiprocessor real-time scheduling considering concurrency and urgency

ACM SIGBED Review - Special Issue on the Work-in-Progress (WIP) Session at the 2009 IEEE Real-Time Systems Symposium (RTSS)
A new fair scheduling algorithm for periodic tasks on multiprocessors

Information Processing Letters
Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems
Global EDF-based scheduling with laxity-driven priority promotion

Journal of Systems Architecture: the EUROMICRO Journal
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Sticky-ERfair: a task-processor affinity aware proportional fair scheduler

Real-Time Systems
DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

Real-Time Systems
Swapping to reduce preemptions and migrations in EKG

ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Zero-laxity based real-time multiprocessor scheduling

Journal of Systems and Software
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

Real-Time Systems
Implementing multicore real-time scheduling algorithms based on task splitting using ada 2012

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
A semi-partitioned real-time scheduling approach for periodic task systems on multicore platforms

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

Real-Time Systems
A global optimal scheduling algorithm for multiprocessor low-power platforms

Proceedings of the 20th International Conference on Real-Time and Network Systems
Enhancing the real-time capabilities of the Linux kernel

ACM SIGBED Review - Special Issue on the 24th Euromicro Conference on Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal of meeting deadlines. Processors are identical and have the same speed. Tasks can be preempted and they can migrate between processors. We propose an algorithm with a utilization bound of 66% and with few preemptions. It can trade a higher utilization bound for more preemptions and in doing so it has a utilization bound of 100%.