The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities

Fisher, Nathan; Baruah, Sanjoy; Baker, Theodore P.

doi:10.1109/ecrts.2006.30

Cited by 77 publications

(83 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using the same decomposition described in Section III, we now derive a resource augmentation bound required to schedule task sets under FBB-FFD (Fisher Baruah BakerFirst-Fit Decreasing) partitioned Deadline Monotonic (DM) scheduling [10] which the previous work on parallel task scheduling [4] uses as its underlying scheduling strategy. However, as was explained earlier, we consider a more general task model and a different task decomposition strategy, and are able to obtain a resource augmentation bound of 5 as shown below.…”

Section: Partitioned Deadline Monotonic Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

Multi-core real-time scheduling for generalized parallel task models

et al. 2012

View full text Add to dashboard Cite

Abstract-Multi-core processors offer a significant performance increase over single core processors. Therefore, they have the potential to enable computation-intensive real-time applications with stringent timing constraints that cannot be met on traditional single-core processors. However, most results in traditional multiprocessor real-time scheduling are limited to sequential programming models and ignore intra-task parallelism. In this paper, we address the problem of scheduling periodic parallel tasks with implicit deadlines on multi-core processors. We first consider a synchronous task model where each task consists of segments, each segment having an arbitrary number of parallel threads that synchronize at the end of the segment. We propose a new task decomposition method that decomposes each parallel task into a set of sequential tasks. We prove that our task decomposition achieves a resource augmentation bound of 4 and 5 when the decomposed tasks are scheduled using global EDF and partitioned deadline monotonic scheduling, respectively. Finally, we extend our analysis to directed acyclic graph (DAG) task model where each node in the DAG has unit execution requirement. We show how these tasks can be converted into synchronous tasks such that the same transformation can be applied and the same augmentation bounds hold.

show abstract

Section: Partitioned Deadline Monotonic Schedulingmentioning

confidence: 99%

“…Proof: According to [10], any constrained deadline sporadic task set π with total utilization u sum (π), maximum density δ max (π), and load λ(π) is schedulable by FBB-FFD on m unit-capacity processors if…”

Section: Partitioned Deadline Monotonic Schedulingmentioning

confidence: 99%

Multi-core real-time scheduling for generalized parallel task models

et al. 2012

View full text Add to dashboard Cite

show abstract

“…As the traditional partitioning approaches [13,25,18,6,14], DM-PM assigns each task to a particular processor, according to kinds of bin-packing heuristics, upon which the schedulable condition for DM is satisfied. In fact, any heuristics are available for DM-PM.…”

Section: Algorithm Descriptionmentioning

confidence: 99%

“…As most partitioning algorithms [13,25,18,14] do, each task is assigned to the first processor upon which a schedulable condition is satisfied. The schedulable condition of T i for P k here is defined by…”

Section: Execution Capacity Of Shared Tasksmentioning

confidence: 99%

Semi-partitioned Fixed-Priority Scheduling on Multiprocessors

Kato

Yamasaki

2009

2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium

View full text Add to dashboard Cite

show abstract

“…In [5], the authors introduced the Task Stretch Transformation (TST) model for parallel synchronous tasks that follow a fork-join structure. The TST considers preemptive fixed-priority periodic tasks with implicit deadlines partitioned according to the Fisher-Baruah-Baker First-Fit-Decreasing (FBB-FFD) [6] algorithm. Similarly, the Segment Stretch Transformation (SST) model was introduced in [7].…”

Section: Related Workmentioning

confidence: 99%

Allocation of Parallel Real-Time Tasks in Distributed Multi-core Architectures Supported by an FTT-SE Network

Garibay-Martínez¹,

Nelissen²,

Ferreira³

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Distributed real-time systems such as automotive applications are becoming larger and more complex, thus, requiring the use of more powerful hardware and software architectures. Furthermore, those distributed applications commonly have stringent real-time constraints. This implies that such applications would gain in flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of allocating fixed-priority fork-join Parallel/Distributed real-time tasks onto distributed multi-core nodes connected through a Flexible Time Triggered Switched Ethernet network. We analyze the system requirements and present a set of formulations based on a constraint programming approach. Constraint programming allows us to express the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution, if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint programming have shown to obtain solutions for these type of formulations in reasonable time. This implies that such applications would gain in flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of allocating fixed-priority fork-join Parallel/Distributed realtime tasks onto distributed multi-core nodes connected through a Flexible Time Triggered Switched Ethernet network. We analyze the system requirements and present a set of formulations based on a constraint programming approach. Constraint programming allows us to express the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution, if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint programming have shown to obtain solutions for these type of formulations in reasonable time.

show abstract

The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities

Cited by 77 publications

References 17 publications

Multi-core real-time scheduling for generalized parallel task models

Multi-core real-time scheduling for generalized parallel task models

Semi-partitioned Fixed-Priority Scheduling on Multiprocessors

Allocation of Parallel Real-Time Tasks in Distributed Multi-core Architectures Supported by an FTT-SE Network

Contact Info

Product

Resources

About