Partitioned scheduling of parallel real-time tasks on multiprocessor systems

Fauberteau, Frédéric; Midonnet, Serge; Qamhieh, Manar

doi:10.1145/2038617.2038623

Cited by 16 publications

(16 citation statements)

References 8 publications

(7 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…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]. The authors converted the parallel threads of a fork-join task into sequential tasks by creating a master thread, but with the difference (when compared to [5]) that no thread is ever allowed to migrate between cores.…”

Section: Related Workmentioning

confidence: 99%

“…Distributed systems have the particularity that the transmission delay of messages communicating threads within a task, cannot be deemed negligible as in the case of multi-core systems [5,7,8]. In here, we extend the problem of task allocation of fork-join real-time tasks presented in [1], by considering (i) a distributed multi-core architecture, and (ii) using a FTT-SE network for message transmission.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Related Workmentioning

confidence: 99%

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

show abstract

“…6. A uniform probability distribution, U (2,12), is used to generate number of tasks in the application. 7.…”

Section: Experiments Setupmentioning

confidence: 99%

“…A vast body of research has been conducted to investigate the problem of scheduling RT-applications across the computing resources of multiprocessor/multicore platforms [1,2,4,7,9,19] or distributed platforms [13,15,21,22,23]. Some proposed partition algorithms to schedule independent RT-tasks [1,15] while others proposed partition algorithms to schedule task graph applications [3,6,7,8,11,12,13,20].…”

Section: Introductionmentioning

confidence: 99%

Efficient Scheduling ff Real-Time Parallel Applications on Clusters

Hamdy¹

2012

IJCSIT

View full text Add to dashboard Cite

show abstract

“…Further, there are other algorithms [23]- [33] with no proven speedup factors for scheduling parallel tasks on homogeneous multiprocessors -some of them [23]- [28] are for constrained-deadline tasks (i.e., a task generates a sequence of jobs and a job has a deadline that may be less than or equal to the minimum inter-arrival time of the task that generates the job) and the others [29]- [33] are for implicit-deadline tasks. Unfortunately, none of these works [16]- [33] support heterogeneous multiprocessors (and moreover most of these algorithms [23]- [33] have no proven speedup factors). A work by Holenderski et.…”

Section: Introductionmentioning

confidence: 99%

Scheduling Constrained-Deadline Parallel Tasks on Two-type Heterogeneous Multiprocessors

Andersson¹,

Raravi²

2015

View full text Add to dashboard Cite

Abstract-Consider the problem of scheduling a taskset on a multiprocessor so that all deadlines are met. Assume (i) constrained-deadline sporadic tasks, i.e., a task generates a sequence of jobs and the deadline of a job is no greater than the minimum inter-arrival time of the task that generates the job, (ii) stage-parallelism, i.e., a task comprises one or more stages with a stage comprising one or many segments so that segments in the same stage are allowed to execute in parallel and a segment is allowed to execute only if all segments of the previous stage have finished, (iii) two-type heterogeneous multiprocessor platform, i.e., there are processors of two types, type-1 and type-2, and for each task, there is a specification of its execution speed on a type-1 processor and on a type-2 processor, and (iv) intratype migration, i.e., a job can migrate between processors of the same type but for a task, all jobs of this task must execute on the same processor type. We present an algorithm for this problem; it assigns each task to a processor type and then schedules tasks on processors of each type with global-Earliest-Deadline-First. This algorithm has pseudo-polynomial time complexity and speedup factor at most 5. This is the first algorithm for scheduling parallel real-time tasks on a heterogeneous multiprocessor with provably good performance.

show abstract

Partitioned scheduling of parallel real-time tasks on multiprocessor systems

Cited by 16 publications

References 8 publications

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

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

Efficient Scheduling ff Real-Time Parallel Applications on Clusters

Scheduling Constrained-Deadline Parallel Tasks on Two-type Heterogeneous Multiprocessors

Contact Info

Product

Resources

About