{"title":"Animation of Linux processor scheduling algorithm","authors":"K. Leung, Du Zhang","doi":"10.1109/ISM.2005.33","DOIUrl":null,"url":null,"abstract":"In this paper, we describe a visualization tool for the Linux processor scheduling algorithm. The tool is developed for use by operating system learners to gain insight on the Linux scheduling algorithm. Through its graphical environment, a user selects a set of predefined processes as input to the tool. Each process selected possesses a specific characteristic geared toward effectively coercing the Linux scheduling algorithm to behave in a particular manner. By running the selected processes and gathering their runtime information, the tool is able to generate diagrams that reveal the intimate knowledge of the Linux scheduler such as dynamic priority assignment of processes, time quantum changes, scheduling sequence of the processes, classification of processes based upon projected CPU cycle requirements, and favoritism in scheduling toward I/O processes over CPU processes. In addition, the tool can be extended to serve as the basis for process performance measuring or optimization purpose.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh IEEE International Symposium on Multimedia (ISM'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISM.2005.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper, we describe a visualization tool for the Linux processor scheduling algorithm. The tool is developed for use by operating system learners to gain insight on the Linux scheduling algorithm. Through its graphical environment, a user selects a set of predefined processes as input to the tool. Each process selected possesses a specific characteristic geared toward effectively coercing the Linux scheduling algorithm to behave in a particular manner. By running the selected processes and gathering their runtime information, the tool is able to generate diagrams that reveal the intimate knowledge of the Linux scheduler such as dynamic priority assignment of processes, time quantum changes, scheduling sequence of the processes, classification of processes based upon projected CPU cycle requirements, and favoritism in scheduling toward I/O processes over CPU processes. In addition, the tool can be extended to serve as the basis for process performance measuring or optimization purpose.