Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems

Authors:
J. M. López;M. García;J. L. Díaz;D. F. García
Affiliations:
University of Oviedo, Department of Computer Science, Gijón, Spain;University of Oviedo, Department of Computer Science, Gijón, Spain;University of Oviedo, Department of Computer Science, Gijón, Spain;University of Oviedo, Department of Computer Science, Gijón, Spain
Venue:
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Year:
2000

Citing 5
Cited 27

Multiprocessor Online Scheduling of Hard-Real-Time Tasks

IEEE Transactions on Software Engineering
Allocating fixed-priority periodic tasks on multiprocessor systems

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems

IEEE Transactions on Computers

Multiprocessor EDF and Deadline Monotonic Schedulability Analysis

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling

IEEE Transactions on Computers
Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors

IEEE Transactions on Computers
Minimum and Maximum Utilization Bounds for Multiprocessor Rate Monotonic Scheduling

IEEE Transactions on Parallel and Distributed Systems
Code-Size Minimization in Multiprocessor Real-Time Systems

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
An Analysis of Fixed-Priority Schedulability on a Multiprocessor

Real-Time Systems
Multiprocessor fixed-priority scheduling with restricted interprocessor migrations

Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
The partitioned dynamic-priority scheduling of sporadic task systems

Real-Time Systems
Energy-aware scheduling for real-time multiprocessor systems with uncertain task execution time

Proceedings of the 44th annual Design Automation Conference
An $\mathsf{EDF}$ -based restricted-migration scheduling algorithm for multiprocessor soft real-time systems

Real-Time Systems
A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm

Real-Time Systems
Deadline Monotonic Scheduling on Uniform Multiprocessors

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed 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
Partition oriented frame based fair scheduler

Journal of Parallel and Distributed Computing
Flexible tardiness bounds for sporadic real-time task systems on multiprocessors

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems
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
Dynamic repartitioning of real-time schedule on a multicore processor for energy efficiency

EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

Real-Time Systems
Assertive dynamic power management (AsDPM) strategy for globally scheduled RT multiprocessor systems

PATMOS'09 Proceedings of the 19th international conference on Integrated Circuit and System Design: power and Timing Modeling, Optimization and Simulation
What to make of multicore processors for reliable real-time systems?

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
The partitioned, static-priority scheduling of sporadic real-time tasks with constrained deadlines on multiprocessor platforms

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Sustainability in static-priority restricted-migration scheduling

Proceedings of the 2012 ACM Research in Applied Computation Symposium
Partitioning sporadic task systems upon memory-constrained multiprocessors

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we present the utilization bound for Earliest Deadline First (EDF) scheduling on homogeneous multiprocessor systems with partitioning strategies. Assuming that tasks are pre-emptively scheduled on each processor according to the EDF algorithm, and allocated according to the First Fit (FF) heuristic, we prove that the worst-case achievable utilization is 0:5(n + 1), where n is the number of processors. This bound is valid for arbitrary utilization factors. Moreover, if all the tasks have utilization factors under a value α, the previous bound is raised, and the new utilization bound considering α is calculated. In addition, we prove that no pair of uniprocessor scheduling algorithm-allocation algorithm can provide a higher worst-case achievable utilization than that of EDF-FF. Finally, simulation provides the average-case achievable utilization for EDF-FF.