Multiprocessor Synchronization of Periodic Real-Time Tasks Using Dependency Graphs

Shi, Junjie; Ueter, Niklas; Brüggen, Georg von der; Chen, Jian-Jia

doi:10.1109/rtas.2019.00031

Cited by 8 publications

(18 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The treatment used in [36] to construct dependency graphs can also be applied here. That is, unroll the jobs of all the tasks in one hyper-period and then construct a dependency graph of these jobs.…”

Section: Extension To Periodic Tasksmentioning

confidence: 99%

“…Table 2, which shows that the overheads of our approach and those of P-FMLP, G-FMLP are comparable. Furthermore, the implementations provided in [36], called P-LIST-EDF and G-LIST-EDF, were evaluated to examine the overhead and reported in Table 2. The direct comparison between P-LIST-EDF and P-DGA-JS (G-LIST-EDF and G-DGA-JS, respectively) is not possible because they are designed for different scenarios, depending on the number of critical sections per task.…”

Section: Overheads Evaluationsmentioning

confidence: 99%

“…4 with the objective to minimize the makespan, denoted as JS. We utilized the constraint programming approach provided in the Google OR-Tools to solve the job shop scheduling problem, 2) The extension to multiple critical sections sketched in [36], denoted as PRP. To check the feasibility of the generated dependency graph, one simulated schedule with respect to the dependency graph is generated.…”

Section: Evaluations Setupmentioning

confidence: 99%

“…We name these algorithms by combining: 1) JS/PRP: the two different dependency graph generation methods. 2) LEDF/PEDF: to schedule the generated graph, we used the LIST-EDF in [36] (LEDF) or partitioned EDF (PEDF) in [37], and a worst-fit partitioning algorithm. 3) P/NP: preemptive or non-preemptive schedule for critical sections.…”

Section: Evaluations Setupmentioning

confidence: 99%

“…However, the original dependency graph approaches presented in [11] has two strong limitations: 1) the construction in the first step allows only one critical section per task, and 2) the presented algorithms can only be applied for frame-based real-time task systems, i.e., all tasks have the same period and release their jobs always at the same time. The latter has been recently removed by Shi et al [36], who applied the DGA after unrolling the jobs in the hyper-period. However, the former remains open and is a fundamental obstacle which limits the generality of the dependency graph approaches.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Scheduling of Real-Time Tasks With Multiple Critical Sections in Multiprocessor Systems

Chen

Shi

Brüggen

et al. 2022

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

The performance of multiprocessor synchronization and locking protocols is a key factor to utilize the computation power of multiprocessor systems under real-time constraints. While multiple protocols have been developed in the past decades, their performance highly depends on the task partition and prioritization. The recently proposed Dependency Graph Approach showed its advantages and attracted a lot of interest. It is, however, restricted to task sets where each task has at most one critical section. In this paper, we remove this restriction and demonstrate how to utilize algorithms for the classical job shop scheduling problem to construct a dependency graph for tasks with multiple critical sections. To show the applicability, we discuss the implementation in LITMUS RT and report the overheads. Moreover, we provide extensive numerical evaluations under different configurations, which in many situations show significant improvement compared to the state-of-the-art.

show abstract

Section: Extension To Periodic Tasksmentioning

confidence: 99%

Section: Overheads Evaluationsmentioning

confidence: 99%

Section: Evaluations Setupmentioning

confidence: 99%

Section: Evaluations Setupmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Scheduling of Real-Time Tasks With Multiple Critical Sections in Multiprocessor Systems

Chen

Shi

Brüggen

et al. 2022

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

Cooperative solutions to exploration tasks under speed and budget constraints

Karishma

Rao

2022

Journal of Simulation

View full text Add to dashboard Cite

We present a multi-agent system where agents can cooperate to solve a system of dependent tasks, with agents having the capability to explore a solution space, make inferences, as well as query for information under a limited budget. Re-exploration of the solution space takes place by an agent when an older solution expires and is thus able to adapt to dynamic changes in the environment. We investigate the effects of task dependencies, with highly-dependent graph G 40 (a well-known program graph that contains 40 highly interlinked nodes, each representing a task) and less-dependent graphs G 18 (a program graph that contains 18 tasks with fewer links), increasing the speed of the agents and the complexity of the problem space and the query budgets available to agents. Specifically, we evaluate trade-offs between the agent's speed and query budget. During the experiments, we observed that increasing the speed of a single agent improves the system performance to a certain point only, and increasing the number of faster agents may not improve the system performance due to task dependencies. Favoring faster agents during budget allocation enhances the system performance, in line with the "Matthew effect." We also observe that allocating more budget to a faster agent gives better performance for a less-dependent system, but increasing the number of faster agents gives a better performance for a highly-dependent system.

show abstract

Partitioned Scheduling for Dependency Graphs in Multiprocessor Real-Time Systems

Shi

Ueter

Brüggen

et al. 2019

2019 IEEE 25th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

View full text Add to dashboard Cite

Multiprocessor Synchronization of Periodic Real-Time Tasks Using Dependency Graphs

Cited by 8 publications

References 47 publications

Scheduling of Real-Time Tasks With Multiple Critical Sections in Multiprocessor Systems

Scheduling of Real-Time Tasks With Multiple Critical Sections in Multiprocessor Systems

Cooperative solutions to exploration tasks under speed and budget constraints

Partitioned Scheduling for Dependency Graphs in Multiprocessor Real-Time Systems

Contact Info

Product

Resources

About