Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors

@article{Kato2009SemipartitionedSO,
  title={Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors},
  author={Shinpei Kato and Nobuyuki Yamasaki and Yutaka Ishikawa},
  journal={2009 21st Euromicro Conference on Real-Time Systems},
  year={2009},
  pages={249-258}
}
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, we design the algorithm so that tasks are qualified to migrate only if a task set cannot be partitioned any more, and such migratory tasks migrate from one processor to another… 
View on IEEE
ny.ics.keio.ac.jp
128 Citations
Highly Influential Citations
13
Background Citations
66
Methods Citations
33
Results Citations
4

128 Citations

Citation Type

Citation Type

Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms
TLDR
This paper proposes a new algorithm and a scheduling paradigm based on the concept of semi-partitioned scheduling with restricted migrations in which jobs are not allowed to migrate, but two subsequent jobs of a task can be assigned to different processors by following a periodic strategy.
Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems
TLDR
This work describes a new algorithm, called quasi-partitioned scheduling (QPS), capable of scheduling any feasible system composed of independent implicit-deadline sporadic tasks on identical processors, and shows that it has very low preemption and migration overheads.
OUTSTANDING PAPER: Optimal and Adaptive Multiprocessor Real-Time Scheduling: The Quasi-Partitioning Approach
TLDR
Quasi-Partitioned Scheduling uses an efficient scheme to switch between partitioned EDF and global-like scheduling rules in response to system load variation, providing dynamic adaptation in the system.
Practical Aspects of Slot-Based Task-Splitting Dispatching in Its Schedulability Analysis
TLDR
A new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm is presented.
Job partitioning strategies for multiprocessor scheduling of real-time periodic tasks with restricted migrations
TLDR
This work considers the scheduling of real-time periodic tasks on multiprocessors under a restricted-migration constraint, and proposes a technique, (offline) job partitioning, which statically assigns jobs to processors before execution.
Multiprocessor Real-Time Scheduling with a Few Migrating Tasks
TLDR
HIME, a new EDF-based semi-partitioned scheduling algorithm which allows at most one migrating task per processor, is presented, which limits the migrating tasks to at least m/2 and the number of migrations per job to at most m-1.
A semi-partitioned real-time scheduling approach for periodic task systems on multicore platforms
TLDR
A new semi-partitioned scheduling algorithm for real-time periodic task systems over multicore platforms is proposed and schedulability analysis and experimental evaluation are provided to support the proposition.
Two-level Hierarchical Scheduling Algorithm for Real-time Multiprocessor Systems
TLDR
This paper proposes a new restricted migration-based scheduling algorithm for multiprocessor real-time systems, called Two-level Hierarchical Scheduling Algorithm (2L-HiSA), to address this sub-optimality of EDF.
Implementing slot-based task-splitting multiprocessor scheduling
TLDR
This paper discusses and proposes some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and reports the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34.
A Bandwidth Reservation Strategy for Multiprocessor Real-Time Scheduling
  • Ernesto Massa, George Lima
  • Computer Science
    2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
  • 2010
TLDR
Results from experiments indicate that the proposed approach performs well in terms of schedulability.
...
...

References

SHOWING 1-10 OF 35 REFERENCES
Semi-partitioned Fixed-Priority Scheduling on Multiprocessors
  • S. Kato, N. Yamasaki
  • Computer Science
    2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium
  • 2009
TLDR
The algorithm is designed so that a task is qualified to migrate, only if it cannot be assigned to any individual processors, in such a way that it is never returned to the same processor within the same period, once it is migrated from one processor to another processor.
Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors
TLDR
A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon multiprocessor platforms, with interprocessor migration permitted, and it is proved to offer superior performance guarantees in comparison to prior feasibility tests.
Real-Time Scheduling with Task Splitting on Multiprocessors
  • S. Kato, N. Yamasaki
  • Computer Science
    13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007)
  • 2007
TLDR
A real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems based on an unorthodox method called portioned scheduling that assigns each task to a particular processor like partitioned scheduling but can split a task into two processors if there is not enough capacity remaining on a processor.
Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems
TLDR
The utilization bound for earliest deadline first EDF scheduling is extended from uniprocessors to homogeneous multiprocessor systems with partitioning strategies, and the basic task model is extended to include resource sharing, release jitter, deadlines less than periods, aperiodic tasks, non-preemptive sections, context switches, and mode changes.
The partitioned dynamic-priority scheduling of sporadic task systems
TLDR
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform and a quantitative characterization of its worst-case performance is provided in terms of resource augmentation.
Preemptively scheduling hard-real-time sporadic tasks on one processor
TLDR
The authors first give necessary and sufficient conditions for a sporadic task system to be feasible (i.e., schedulable) and lead to a feasibility test that runs in efficient pseudo-polynomial time for a very large percentage of sporadic task systems.
Sporadic Multiprocessor Scheduling with Few Preemptions
TLDR
An algorithm with limited migration, configurable for a utilisation bound of 88% with few preemptions (and arbitrarily close to 100% with more preemptions) is proposed.
Multiprocessor Scheduling with Few Preemptions
  • Björn Andersson, E. Tovar
  • Computer Science
    12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)
  • 2006
TLDR
An algorithm with a utilization bound of 66% and with few preemptions is proposed that can trade a higher utilization bound for more preemptions and in doing so it has a utilized bound of 100%.
Portioned EDF-based scheduling on multiprocessors
TLDR
An EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems is presented.
Scheduling aperiodic tasks in dynamic priority systems
TLDR
Five new on-line algorithms for servicing soft aperiodic requests in realtime systems, where a set of hard periodic tasks is scheduled using the Earliest Deadline First (EDF) algorithm, can achieve full processor utilization and enhance a periodic responsiveness.
...
...