Heba E. Hassan, Gihan Nagib, Khaled Hosny Ibrahiem
{"title":"基于进化模糊的软实时多处理器系统调度算法","authors":"Heba E. Hassan, Gihan Nagib, Khaled Hosny Ibrahiem","doi":"10.1109/JAC-ECC48896.2019.9051189","DOIUrl":null,"url":null,"abstract":"Scheduling algorithms are designed to ensure high level of performance for real-time systems by optimizing the allocation of resources and time to tasks thus meeting specific system requirements. The task scheduling problem is known to be NP-Complete and is not simply solved. This paper proposes a novel scheduling algorithm for real-time systems using two fuzzy inference engines. The results of the proposed algorithm are compared with those of the two existing scheduling algorithms which are the Earliest Deadline First and Least Laxity First scheduling algorithms. The scope of this paper is limited to the non-preemptive independent tasks for a multiprocessor environment.","PeriodicalId":351812,"journal":{"name":"2019 7th International Japan-Africa Conference on Electronics, Communications, and Computations, (JAC-ECC)","volume":"215 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Evolutionary Fuzzy based Scheduling Algorithm for Soft Real-Time Multiprocessor Systems\",\"authors\":\"Heba E. Hassan, Gihan Nagib, Khaled Hosny Ibrahiem\",\"doi\":\"10.1109/JAC-ECC48896.2019.9051189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scheduling algorithms are designed to ensure high level of performance for real-time systems by optimizing the allocation of resources and time to tasks thus meeting specific system requirements. The task scheduling problem is known to be NP-Complete and is not simply solved. This paper proposes a novel scheduling algorithm for real-time systems using two fuzzy inference engines. The results of the proposed algorithm are compared with those of the two existing scheduling algorithms which are the Earliest Deadline First and Least Laxity First scheduling algorithms. The scope of this paper is limited to the non-preemptive independent tasks for a multiprocessor environment.\",\"PeriodicalId\":351812,\"journal\":{\"name\":\"2019 7th International Japan-Africa Conference on Electronics, Communications, and Computations, (JAC-ECC)\",\"volume\":\"215 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 7th International Japan-Africa Conference on Electronics, Communications, and Computations, (JAC-ECC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JAC-ECC48896.2019.9051189\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 7th International Japan-Africa Conference on Electronics, Communications, and Computations, (JAC-ECC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JAC-ECC48896.2019.9051189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Evolutionary Fuzzy based Scheduling Algorithm for Soft Real-Time Multiprocessor Systems
Scheduling algorithms are designed to ensure high level of performance for real-time systems by optimizing the allocation of resources and time to tasks thus meeting specific system requirements. The task scheduling problem is known to be NP-Complete and is not simply solved. This paper proposes a novel scheduling algorithm for real-time systems using two fuzzy inference engines. The results of the proposed algorithm are compared with those of the two existing scheduling algorithms which are the Earliest Deadline First and Least Laxity First scheduling algorithms. The scope of this paper is limited to the non-preemptive independent tasks for a multiprocessor environment.