一种改进的多处理器实时系统动态调度算法

Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2003-10-20 DOI:10.1109/PDCAT.2003.1236397

Zhu Xiangbin, Tu Shiliang

{"title":"一种改进的多处理器实时系统动态调度算法","authors":"Zhu Xiangbin, Tu Shiliang","doi":"10.1109/PDCAT.2003.1236397","DOIUrl":null,"url":null,"abstract":"In the scheduling algorithms on multiprocessor real-time systems, the heuristic algorithm is an important algorithm and a known heuristic algorithm is myopic algorithm (K.Ramamritham, et. at., 1990). The performance of the myopic algorithm is greatly based on heuristic functions. We present an improved heuristic algorithm, which has a new heuristic function. The improved algorithm considers not only the deadlines and the resource requirements of a task, but also the processing time of the task. The most important metric for real-time scheduling algorithms is scheduling success ratio. To evaluate the effectiveness of the improved algorithm, we have done extensive simulation studies. The simulation results show that the scheduling success ratio of the improved heuristic algorithm is superior to that of myopic algorithm.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"104 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An improved dynamic scheduling algorithm for multiprocessor real-time systems\",\"authors\":\"Zhu Xiangbin, Tu Shiliang\",\"doi\":\"10.1109/PDCAT.2003.1236397\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the scheduling algorithms on multiprocessor real-time systems, the heuristic algorithm is an important algorithm and a known heuristic algorithm is myopic algorithm (K.Ramamritham, et. at., 1990). The performance of the myopic algorithm is greatly based on heuristic functions. We present an improved heuristic algorithm, which has a new heuristic function. The improved algorithm considers not only the deadlines and the resource requirements of a task, but also the processing time of the task. The most important metric for real-time scheduling algorithms is scheduling success ratio. To evaluate the effectiveness of the improved algorithm, we have done extensive simulation studies. The simulation results show that the scheduling success ratio of the improved heuristic algorithm is superior to that of myopic algorithm.\",\"PeriodicalId\":145111,\"journal\":{\"name\":\"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"volume\":\"104 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT.2003.1236397\",\"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 Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2003.1236397","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

在多处理器实时系统的调度算法中，启发式算法是一种重要的算法，已知的启发式算法是近视算法(K.Ramamritham等)。, 1990)。近视算法的性能很大程度上依赖于启发式函数。提出了一种改进的启发式算法，该算法具有新的启发式功能。改进后的算法不仅考虑了任务的最后期限和资源需求，还考虑了任务的处理时间。实时调度算法最重要的指标是调度成功率。为了评估改进算法的有效性，我们进行了大量的仿真研究。仿真结果表明，改进的启发式算法的调度成功率优于近视算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An improved dynamic scheduling algorithm for multiprocessor real-time systems

In the scheduling algorithms on multiprocessor real-time systems, the heuristic algorithm is an important algorithm and a known heuristic algorithm is myopic algorithm (K.Ramamritham, et. at., 1990). The performance of the myopic algorithm is greatly based on heuristic functions. We present an improved heuristic algorithm, which has a new heuristic function. The improved algorithm considers not only the deadlines and the resource requirements of a task, but also the processing time of the task. The most important metric for real-time scheduling algorithms is scheduling success ratio. To evaluate the effectiveness of the improved algorithm, we have done extensive simulation studies. The simulation results show that the scheduling success ratio of the improved heuristic algorithm is superior to that of myopic algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies

自引率

0.00%

发文量