Welcome to the InfoSci Platform
Reference Hub1
A Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks

A Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks

Shaohua Teng, Wei Zhang, Haibin Zhu, Xiufen Fu, Jiangyi Su, Baoliang Cui
Copyright: © 2010 |Volume: 2 |Issue: 2 |Pages: 19
ISSN: 1942-9045|EISSN: 1942-9037|EISBN13: 9781609604196|DOI: 10.4018/jssci.2010040105
Cite Article Cite Article

MLA

Teng, Shaohua, et al. "A Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks." IJSSCI vol.2, no.2 2010: pp.86-104. http://doi.org/10.4018/jssci.2010040105

APA

Teng, S., Zhang, W., Zhu, H., Fu, X., Su, J., & Cui, B. (2010). A Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks. International Journal of Software Science and Computational Intelligence (IJSSCI), 2(2), 86-104. http://doi.org/10.4018/jssci.2010040105

Chicago

Teng, Shaohua, et al. "A Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks," International Journal of Software Science and Computational Intelligence (IJSSCI) 2, no.2: 86-104. http://doi.org/10.4018/jssci.2010040105

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.