Jung, JinmanJinmanJungShin, JonghoJonghoShinHong, JimanJimanHongLee, JinwooJinwooLeeTEI-WEI KUO2020-05-042020-05-042017https://scholars.lib.ntu.edu.tw/handle/123456789/489927https://www.scopus.com/inward/record.uri?eid=2-s2.0-85043316268&doi=10.1145%2f3129676.3129736&partnerID=40&md5=da87482908699322c715f54b072f9863With the emergence of increasingly heterogeneous devices and networks, computing systems are required to support a variety of services with difierent quality of service requirements. The degree of heterogeneity makes it more dificult to fairly allocate resources based on the client's weight. Moreover, as the systems become larger, their performance can worsen significantly. In this paper, we present a fair scheduling algorithm for multiprocessor systems using a task satisfaction index. The proposed algorithm, called LZF, aims to achieve a high level of proportional fairness for the heterogeneous tasks. The evaluation results show that its service time error is bounded between -1 and 1, and the LZF achieves the best proportional fairness among existing scheduling algorithms with respect to the average service time error. © 2017 Association for Computing Machinery.CPU scheduling; Fairness; Proportional share scheduling; Quality of Service; Resource managements[SDGs]SDG9Multiprocessing systems; Quality of service; Scheduling; Telecommunication services; CPU scheduling; Fair scheduling algorithm; Fairness; Heterogeneous devices; Multi processor systems; Proportional fairness; Proportional-share; Resource management; Scheduling algorithmsconference paper10.1145/3129676.3129736https://doi.org/10.1145/3129676.3129736