The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks
|
Author(s): Shaohua Teng (Guangdong University of Technology, China), Wei Zhang (Guangdong University of Technology, China), Haibin Zhu (Nipissing University, Canada), Xiufen Fu (Guangdong University of Technology, China), Jiangyi Su (Guangdong University of Technology, China)and Baoliang Cui (Guangdong University of Technology, China)
Copyright: 2012
Pages: 18
Source title:
Breakthroughs in Software Science and Computational Intelligence
Source Author(s)/Editor(s): Yingxu Wang (University of Calgary, Canada)
DOI: 10.4018/978-1-4666-0264-9.ch017
Purchase
|
Abstract
The LLF (Least Laxity First) scheduling algorithm assigns a priority to a task according to its executing urgency. The smaller the laxity value of a task is, the sooner it needs to be executed. When two or more tasks have same or approximate laxity values, LLF scheduling algorithm leads to frequent switches among tasks, causes extra overhead in a system, and therefore, restricts its application. The least switch and laxity first scheduling algorithm is proposed in this paper by searching out an appropriate common divisor in order to improve the LLF algorithm for periodic tasks.
Related Content
Bhargav Naidu Matcha, Sivakumar Sivanesan, K. C. Ng, Se Yong Eh Noum, Aman Sharma.
© 2023.
60 pages.
|
Lavanya Sendhilvel, Kush Diwakar Desai, Simran Adake, Rachit Bisaria, Hemang Ghanshyambhai Vekariya.
© 2023.
15 pages.
|
Jayanthi Ganapathy, Purushothaman R., Ramya M., Joselyn Diana C..
© 2023.
14 pages.
|
Prince Rajak, Anjali Sagar Jangde, Govind P. Gupta.
© 2023.
14 pages.
|
Mustafa Eren Akpınar.
© 2023.
9 pages.
|
Sreekantha Desai Karanam, Krithin M., R. V. Kulkarni.
© 2023.
34 pages.
|
Omprakash Nayak, Tejaswini Pallapothala, Govind P. Gupta.
© 2023.
19 pages.
|
|
|