{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:28:59Z","timestamp":1783700939339,"version":"3.55.0"},"reference-count":17,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,4,1]]},"abstract":"<p>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.<\/p>","DOI":"10.4018\/jssci.2010040105","type":"journal-article","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T17:08:36Z","timestamp":1277917716000},"page":"86-104","source":"Crossref","is-referenced-by-count":3,"title":["A Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks"],"prefix":"10.4018","volume":"2","author":[{"given":"Shaohua","family":"Teng","sequence":"first","affiliation":[{"name":"Guangdong University of Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Guangdong University of Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haibin","family":"Zhu","sequence":"additional","affiliation":[{"name":"Nipissing University, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiufen","family":"Fu","sequence":"additional","affiliation":[{"name":"Guangdong University of Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiangyi","family":"Su","sequence":"additional","affiliation":[{"name":"Guangdong University of Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baoliang","family":"Cui","sequence":"additional","affiliation":[{"name":"Guangdong University of Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jssci.2010040105-0","doi-asserted-by":"publisher","DOI":"10.1145\/132271.132276"},{"key":"jssci.2010040105-1","doi-asserted-by":"publisher","DOI":"10.1109\/32.58762"},{"key":"jssci.2010040105-2","unstructured":"Hildebrandt, J., Golatowski, F., & Timmermann, D. (1999). Scheduling coprocessor for enhanced least-laxity-first scheduling in hard real-time systems. In Proceedings of the 11th Euromicro Conference on Real-Time Systems (pp. 208-215). Washington, DC: IEEE Computer Society Press."},{"key":"jssci.2010040105-3","unstructured":"Jensen, E. D., Locke, C. D., & Toduda, H. (1985). A time-driven scheduling model for real-time operating systems. In Proceedings of the 6th IEEE Real-Time Systems Symposium, San Diego, CA (pp. 112-122). Washington, DC: IEEE Computer Society Press."},{"key":"jssci.2010040105-4","unstructured":"Jin, H., Wang, H., Wang, Q., & Dai, G. (2004). An improved least-slack first scheduling algorithm. Journal of software, 15(8), 1116-1123."},{"issue":"1","key":"jssci.2010040105-5","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in a hard real-time environment.","volume":"20","author":"C. L.Liu","year":"1973","journal-title":"Journal of the Association for Computing Machinery"},{"key":"jssci.2010040105-6","doi-asserted-by":"crossref","unstructured":"Naghibzadeh, M., & Kim, K. H. (2002). A Modified Version of Rate-Monotonic Scheduling Algorithm and its Efficiency Assessment. In Proceedings of the 7th IEEE international workshop on Object-Oriented real-time dependable systems (pp. 289-294).","DOI":"10.1109\/WORDS.2002.1000064"},{"issue":"4","key":"jssci.2010040105-7","first-page":"237","article-title":"The Real-Time Task Scheduling Algorithm of RTOS+.","volume":"29","author":"C. F.Ngolah","year":"2004","journal-title":"IEEE Canadian Journal of Electrical and Computer Engineering"},{"key":"jssci.2010040105-8","unstructured":"Oh, S., & Yang, S. (1998). A modified least-laxity-first scheduling algorithm for real-time tasks. In Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications (pp. 31-36). Washington, DC: IEEE Computer Society Press."},{"key":"jssci.2010040105-9","author":"A. S.Tanenbaum","year":"2002","journal-title":"Modern operating systems"},{"key":"jssci.2010040105-10","unstructured":"Tang, X., Liang, H., Zhe, F., & Tang, Z. (2007, May). Computer Operating System (3rd edition). Shaanxi, China: Xidian University Press."},{"issue":"1","key":"jssci.2010040105-11","first-page":"64","article-title":"Research on preemptions of preemptive EDF and improvement on its performance.","volume":"32","author":"J.Wang","year":"2004","journal-title":"Acta Electronica Sinica"},{"key":"jssci.2010040105-12","first-page":"310","article-title":"A new Priority Table based Real-time Scheduling Algorithm.","volume":"2","author":"Q.Wang","year":"2004","journal-title":"Acta Electronica Sinica"},{"key":"jssci.2010040105-13","doi-asserted-by":"crossref","unstructured":"Wang, Y. (2003). On Cognitive Informatics. Brain and Mind: A Transdisciplinary Journal of Neuroscience and Neurophilosophy, 4(2), 151-167.","DOI":"10.1023\/A:1025401527570"},{"issue":"1","key":"jssci.2010040105-14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/jcini.2007010101","article-title":"The Theoretical Framework of Cognitive Informatics.","volume":"1","author":"Y.Wang","year":"2007","journal-title":"International Journal of Cognitive Informatics and Natural Intelligence"},{"key":"jssci.2010040105-15","unstructured":"Wang, Y., & Saksena, M. (1999). Scheduling fixed-priority tasks with preemption threshold. In Proceedings of the 6th International Conference On Real-Time Computing Systems and Applications (pp. 328-335). Washington, DC: IEEE Computer Society Press."},{"key":"jssci.2010040105-16","unstructured":"Zhang, W., & Fu, X. (2006). An Improved Least-Laxity-First Scheduling Algorithm for periodic tasks. Journal of Jiangxi normal university, 30(4), 365-368"}],"container-title":["International Journal of Software Science and Computational Intelligence"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=43899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T01:10:26Z","timestamp":1654132226000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jssci.2010040105"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,4,1]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jssci.2010040105","relation":{},"ISSN":["1942-9045","1942-9037"],"issn-type":[{"value":"1942-9045","type":"print"},{"value":"1942-9037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,1]]}}}