Safety Verification of Rate-Monotonic Least-Splitting Real-Time Scheduler on Multiprocessor System

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Rezaeian Amin; Ghavidel Abolfazl; Sedaghat Yasser

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF COMPUTER AND KNOWLEDGE ENGINEERING Year:2018 | Volume:1 | Issue:1 Page(s): 43-52

Download Full-Text

View:

258

Download:

108

Cites:

Information Journal Paper

Title

Safety Verification of Rate-Monotonic Least-Splitting Real-Time Scheduler on Multiprocessor System

Author(s)

Rezaeian Amin | Ghavidel Abolfazl | Sedaghat Yasser | Issue Writer Certificate

Keywords

Rate-Monotonic Least Splitting

Semi-Partitioning

Hard real-time

Multiprocessor Scheduling

Abstract

In real-time task scheduling on multiprocessor systems, partitioning approach has received the attention of many researchers because of its higher least upper bound utilization of safe systems. Semi-Partitioning allows some tasks to be split into subtasks and each subtask to be assigned to a different processor. Though task splitting improves the performance of systems, by counting each subtask as a separate task, it increases the effective number of tasks to be scheduled, which in turn, raises the execution overhead. This research is on Semi-Partitioning of tasks and assigning each partition to a separate processor to be scheduled by the well-known scheduler Rate-Monotonic (RM). Using our algorithm, we do not need to define release time for subtasks of a task to assure their nonconcurrent execution and the number of effective tasks, in turn, is reduced. It is theoretically proven that with the proposed Semi-Partitioning and RM scheduling algorithm, all processors may safely run their tasks according to their deadlines. Further, experimental results on 3000 randomly generated task-sets indicates that not only is utilization factor boosted, but the number of broken tasks also is decreased.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Rezaeian, Amin, Ghavidel, Abolfazl, & Sedaghat, Yasser. (2018). Safety Verification of Rate-Monotonic Least-Splitting Real-Time Scheduler on Multiprocessor System. JOURNAL OF COMPUTER AND KNOWLEDGE ENGINEERING, 1(1), 43-52. SID. https://sid.ir/paper/353629/en

Vancouver: Copy

Rezaeian Amin, Ghavidel Abolfazl, Sedaghat Yasser. Safety Verification of Rate-Monotonic Least-Splitting Real-Time Scheduler on Multiprocessor System. JOURNAL OF COMPUTER AND KNOWLEDGE ENGINEERING[Internet]. 2018;1(1):43-52. Available from: https://sid.ir/paper/353629/en

IEEE: Copy

Amin Rezaeian, Abolfazl Ghavidel, and Yasser Sedaghat, “Safety Verification of Rate-Monotonic Least-Splitting Real-Time Scheduler on Multiprocessor System,” JOURNAL OF COMPUTER AND KNOWLEDGE ENGINEERING, vol. 1, no. 1, pp. 43–52, 2018, [Online]. Available: https://sid.ir/paper/353629/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops