pCOMPATS: Period-Compatible Task Allocation and Splitting on Multi-core Processors

Kandhalu, Arvind; Lakshmanan, Karthik; Kim, Junsung; Rajkumar, Ragunathan

doi:10.1109/rtas.2012.18

Cited by 11 publications

(29 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The overhead of task splitting is the same as in previous approaches [6,8]. Based on these studies, the overhead of context switching due to task splitting is negligible.…”

Section: Related Workmentioning

confidence: 80%

“…The second row in Table 4 shows tasks with random utilization between 0.01 and 0.49 in order for SS-DRM to be comparable with pCOMPATS [6]. As mentioned earlier, tasks in pCOMPATS are divided into two groups: light and heavy.…”

Section: Discussionmentioning

confidence: 99%

“…Then, some studies worked on periodic tasks [4,[6][7][8]. An approach called PDMS_HPTS selects and splits the highest priority task in each processor [8].…”

Section: Related Workmentioning

confidence: 99%

“…An approach called pCOMPATS was proposed [6] for multicore platforms. As the number of cores increases, this approach can achieve 100% utilization.…”

Section: Related Workmentioning

confidence: 99%

“…It means that the release time of each subtask of a split-task is equal to the total worst response time of prior subtasks. This release time is calculated as shown in Formula (6).…”

Section: B Assigning Normal Tasksmentioning

confidence: 99%

See 4 more Smart Citations

SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor Platforms

Senobary¹,

Naghibzadeh

2014

Journal of Computing Science and Engineering

View full text Add to dashboard Cite

Semi-partitioned scheduling is a new approach for allocating tasks on multiprocessor platforms. By splitting some tasks between processors, semi-partitioned scheduling is used to improve processor utilization. In this paper, a new semi-partitioned scheduling algorithm called SS-DRM is proposed for multiprocessor platforms. The scheduling policy used in SS-DRM is based on the delayed rate monotonic algorithm, which is a modified version of the rate monotonic algorithm that can achieve higher processor utilization. This algorithm can safely schedule any system composed of two tasks with total utilization less than or equal to that on a single processor. First, it is formally proven that any task which is feasible under the rate monotonic algorithm will be feasible under the delayed rate monotonic algorithm as well. Then, the existing allocation method is extended to the delayed rate monotonic algorithm. After that, two improvements are proposed to achieve more processor utilization with the SS-DRM algorithm than with the rate monotonic algorithm. According to the simulation results, SS-DRM improves the scheduling performance compared with previous work in terms of processor utilization, the number of required processors, and the number of created subtasks.

show abstract

“…The overhead of task splitting is the same as in previous approaches [6,8]. Based on these studies, the overhead of context switching due to task splitting is negligible.…”

Section: Related Workmentioning

confidence: 80%

Section: Discussionmentioning

confidence: 99%

“…Then, some studies worked on periodic tasks [4,[6][7][8]. An approach called PDMS_HPTS selects and splits the highest priority task in each processor [8].…”

Section: Related Workmentioning

confidence: 99%

“…An approach called pCOMPATS was proposed [6] for multicore platforms. As the number of cores increases, this approach can achieve 100% utilization.…”

Section: Related Workmentioning

confidence: 99%

“…It means that the release time of each subtask of a split-task is equal to the total worst response time of prior subtasks. This release time is calculated as shown in Formula (6).…”

Section: B Assigning Normal Tasksmentioning

confidence: 99%

See 3 more Smart Citations