C. Shih, P. Ganti, S. Gopalakrishnan, M. Caccamo, L. Sha
{"title":"多功能相控阵雷达驻留任务周期的合成","authors":"C. Shih, P. Ganti, S. Gopalakrishnan, M. Caccamo, L. Sha","doi":"10.1109/NRC.2004.1316411","DOIUrl":null,"url":null,"abstract":"The paper addresses the problem of scheduling radar dwells in multi-function phased array radar systems. The timing constraints of radar tasks are usually modeled by the minimal and maximal temporal distance between any two consecutive dwells of a task. Such timing constraints make it difficult for traditional real-time scheduling techniques to provide predictable timing guarantees, without over-consuming resources. We propose a novel approach to model the dwells as periodic real-time tasks. The periods of the tasks are synthesized by the minimal and maximal temporal distance constraint of the dwells. The synthetic periods allow the template-based scheduling algorithm to compute efficient dwell schedules with low overhead. We evaluate the algorithms via extensive simulations. Simulation results show that this algorithm can significantly improve resource utilization, compared with traditional dwell scheduling algorithms.","PeriodicalId":268965,"journal":{"name":"Proceedings of the 2004 IEEE Radar Conference (IEEE Cat. No.04CH37509)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Synthesizing task periods for dwells in multi-function phased array radars\",\"authors\":\"C. Shih, P. Ganti, S. Gopalakrishnan, M. Caccamo, L. Sha\",\"doi\":\"10.1109/NRC.2004.1316411\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper addresses the problem of scheduling radar dwells in multi-function phased array radar systems. The timing constraints of radar tasks are usually modeled by the minimal and maximal temporal distance between any two consecutive dwells of a task. Such timing constraints make it difficult for traditional real-time scheduling techniques to provide predictable timing guarantees, without over-consuming resources. We propose a novel approach to model the dwells as periodic real-time tasks. The periods of the tasks are synthesized by the minimal and maximal temporal distance constraint of the dwells. The synthetic periods allow the template-based scheduling algorithm to compute efficient dwell schedules with low overhead. We evaluate the algorithms via extensive simulations. Simulation results show that this algorithm can significantly improve resource utilization, compared with traditional dwell scheduling algorithms.\",\"PeriodicalId\":268965,\"journal\":{\"name\":\"Proceedings of the 2004 IEEE Radar Conference (IEEE Cat. No.04CH37509)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2004 IEEE Radar Conference (IEEE Cat. No.04CH37509)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NRC.2004.1316411\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2004 IEEE Radar Conference (IEEE Cat. No.04CH37509)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NRC.2004.1316411","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Synthesizing task periods for dwells in multi-function phased array radars
The paper addresses the problem of scheduling radar dwells in multi-function phased array radar systems. The timing constraints of radar tasks are usually modeled by the minimal and maximal temporal distance between any two consecutive dwells of a task. Such timing constraints make it difficult for traditional real-time scheduling techniques to provide predictable timing guarantees, without over-consuming resources. We propose a novel approach to model the dwells as periodic real-time tasks. The periods of the tasks are synthesized by the minimal and maximal temporal distance constraint of the dwells. The synthetic periods allow the template-based scheduling algorithm to compute efficient dwell schedules with low overhead. We evaluate the algorithms via extensive simulations. Simulation results show that this algorithm can significantly improve resource utilization, compared with traditional dwell scheduling algorithms.