Thread-level priority assignment in global multiprocessor scheduling for DAG tasks

Chwa, Hoon Sung; Lee, Jin-Kyu; Shin, Insik

doi:10.1016/j.jss.2015.12.004

Cited by 10 publications

(2 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The LS and HLS algorithms are based on creating a feasible tree of priority assignment strategies and cutting in accordance with the upper and lower bounds of WETED. Several priority assignment strategies are available for multi-processors in the arbitrary deadline model [23,24,25].…”

Section: Related Workmentioning

confidence: 99%

A New Method of Priority Assignment for Real-Time Flows in the WirelessHART Network by the TDMA Protocol

Zhang

et al. 2018

Sensors

View full text Add to dashboard Cite

WirelessHART is a wireless sensor network that is widely used in real-time demand analyses. A key challenge faced by WirelessHART is to ensure the character of real-time data transmission in the network. Identifying a priority assignment strategy that reduces the delay in flow transmission is crucial in ensuring real-time network performance and the schedulability of real-time network flows. We study the priority assignment of real-time flows in WirelessHART on the basis of the multi-channel time division multiple access (TDMA) protocol to reduce the delay and improve the ratio of scheduled. We provide three kinds of methods: (1) worst fit, (2) best fit, and (3) first fit and choose the most suitable one, namely the worst-fit method for allocating flows to each channel. More importantly, we propose two heuristic algorithms—a priority assignment algorithm based on the greedy strategy for C (WF-C) and a priority assignment algorithm based on the greedy strategy for U(WF-U)—for assigning priorities to the flows in each channel, whose time complexity is Ofalse(max(N∗m∗logfalse(mfalse),(N−m)2)false). We then build a new simulation model to simulate the transmission of real-time flows in WirelessHART. Finally, we compare our two algorithms with WF-D and HLS algorithms in terms of the average value of the total end-to-end delay of flow sets, the ratio of schedulable flow sets, and the calculation time of the schedulability analysis. The optimal algorithm WF-C reduces the delay by up to 44.18% and increases the schedulability ratio by up to 70.7%, and it reduces the calculation time compared with the HLS algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

A New Method of Priority Assignment for Real-Time Flows in the WirelessHART Network by the TDMA Protocol

Zhang

et al. 2018

Sensors

View full text Add to dashboard Cite

show abstract

“…Realtime scheduling research primarily focuses on two critical areas: the design of scheduling algorithms and schedulability analysis. The former determines the execution order of real-time tasks, while the latter involves a mathematical assessment of whether a system can meet its deadlines under a scheduling algorithm [2][3][4][5].…”

Section: Introductionmentioning

confidence: 99%

Contention-Free Scheduling for Single Preemption Multiprocessor Platforms

Baek

Lee

2023

Mathematics

View full text Add to dashboard Cite

The Contention-Free (CF) policy has been extensively researched in the realm of real-time multi-processor scheduling due to its wide applicability and the performance enhancement benefits it provides to existing scheduling algorithms. The CF policy improves the feasibility of executing other real-time tasks by assigning the lowest priority to a task at a moment when it is guaranteed not to miss its deadline during the remaining execution time. Despite its effectiveness, existing studies on the CF policy are largely confined to preemptive scheduling, leaving the efficiency and applicability of limited preemption scheduling unexplored. Limited preemption scheduling permits a job to execute to completion with a limited number of preemptions, setting it apart from preemptive scheduling. This type of scheduling is crucial when preemption or migration overheads are either excessively large or unpredictable. In this paper, we introduce SP-CF, a single preemption scheduling approach that incorporates the CF policy. SP-CF allows a preemption only once during each job’s execution, following a priority demotion under the CF policy. We also propose a new schedulability analysis method for SP-CF to determine whether each task is executed in a timely manner and without missing its deadline. Through simulation experiments, we demonstrate that SP-CF can significantly enhance the schedulability of the traditional rate-monotonic algorithm and the earliest deadline first algorithm.

show abstract

Empirical Evaluation of a Real-Time Task Priority Procedure on Small/Medium-Scale Multi-core Systems

Kumar

Satyanarayana

Rao

et al. 2018

Integrated Intelligent Computing, Communication and Security

View full text Add to dashboard Cite

Thread-level priority assignment in global multiprocessor scheduling for DAG tasks

Cited by 10 publications

References 46 publications

A New Method of Priority Assignment for Real-Time Flows in the WirelessHART Network by the TDMA Protocol

A New Method of Priority Assignment for Real-Time Flows in the WirelessHART Network by the TDMA Protocol

Contention-Free Scheduling for Single Preemption Multiprocessor Platforms

Empirical Evaluation of a Real-Time Task Priority Procedure on Small/Medium-Scale Multi-core Systems

Contact Info

Product

Resources

About