Mohammed I. Alghamdi, Xunfei Jiang, X. Qin, Jifu Zhang, Minghua Jiang, Meikang Qiu
{"title":"分布式实时系统的两阶段调度","authors":"Mohammed I. Alghamdi, Xunfei Jiang, X. Qin, Jifu Zhang, Minghua Jiang, Meikang Qiu","doi":"10.1109/ComComAp.2014.7017186","DOIUrl":null,"url":null,"abstract":"In this work we propose a two-phase scheduling technique (TOPS) for distributed real-time systems. The first phase of TOPS is in charge of producing a scheduling sequence, whereas the second phase aims to dispatch tasks to computing nodes of a distributed system. The two phases are independent of one another and; therefore, one can change a policy in one phase without configuring another phase. TOPS makes it possible to observe the impacts of sorting policies on the performance of scheduling policies. We implement a TOPS prototype, in which the first phase is comprised of three sorting policies and the second phase consists of two scheduling policies in the second phase. TOPS enables us to discover that combining the EDF (Earliest-Deadline-First) and AEAP (As-Early-As-Possible) policies leads to an optimized performance among all the six candidate algorithms.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"TOPS: Two-phase scheduling for distributed real-time systems\",\"authors\":\"Mohammed I. Alghamdi, Xunfei Jiang, X. Qin, Jifu Zhang, Minghua Jiang, Meikang Qiu\",\"doi\":\"10.1109/ComComAp.2014.7017186\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we propose a two-phase scheduling technique (TOPS) for distributed real-time systems. The first phase of TOPS is in charge of producing a scheduling sequence, whereas the second phase aims to dispatch tasks to computing nodes of a distributed system. The two phases are independent of one another and; therefore, one can change a policy in one phase without configuring another phase. TOPS makes it possible to observe the impacts of sorting policies on the performance of scheduling policies. We implement a TOPS prototype, in which the first phase is comprised of three sorting policies and the second phase consists of two scheduling policies in the second phase. TOPS enables us to discover that combining the EDF (Earliest-Deadline-First) and AEAP (As-Early-As-Possible) policies leads to an optimized performance among all the six candidate algorithms.\",\"PeriodicalId\":422906,\"journal\":{\"name\":\"2014 IEEE Computers, Communications and IT Applications Conference\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Computers, Communications and IT Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ComComAp.2014.7017186\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Computers, Communications and IT Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ComComAp.2014.7017186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
TOPS: Two-phase scheduling for distributed real-time systems
In this work we propose a two-phase scheduling technique (TOPS) for distributed real-time systems. The first phase of TOPS is in charge of producing a scheduling sequence, whereas the second phase aims to dispatch tasks to computing nodes of a distributed system. The two phases are independent of one another and; therefore, one can change a policy in one phase without configuring another phase. TOPS makes it possible to observe the impacts of sorting policies on the performance of scheduling policies. We implement a TOPS prototype, in which the first phase is comprised of three sorting policies and the second phase consists of two scheduling policies in the second phase. TOPS enables us to discover that combining the EDF (Earliest-Deadline-First) and AEAP (As-Early-As-Possible) policies leads to an optimized performance among all the six candidate algorithms.