利用进化策略在实时系统中调度任务

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems Pub Date : 1995-04-25 DOI:10.1109/WPDRTS.1995.470487

G. Greenwood, C. Lang, S. Hurley

{"title":"利用进化策略在实时系统中调度任务","authors":"G. Greenwood, C. Lang, S. Hurley","doi":"10.1109/WPDRTS.1995.470487","DOIUrl":null,"url":null,"abstract":"Finding feasible schedules for tasks running in hard, real-time distributed computing systems is generally NP-hard. This paper describes a heuristic algorithm using evolutionary strategies. Our results indicate that the evolutionary strategies can find feasible schedules (assuming they exist) in very short periods of time.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"166 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Scheduling tasks in real-time systems using evolutionary strategies\",\"authors\":\"G. Greenwood, C. Lang, S. Hurley\",\"doi\":\"10.1109/WPDRTS.1995.470487\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finding feasible schedules for tasks running in hard, real-time distributed computing systems is generally NP-hard. This paper describes a heuristic algorithm using evolutionary strategies. Our results indicate that the evolutionary strategies can find feasible schedules (assuming they exist) in very short periods of time.<<ETX>>\",\"PeriodicalId\":438550,\"journal\":{\"name\":\"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems\",\"volume\":\"166 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WPDRTS.1995.470487\",\"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 Third Workshop on Parallel and Distributed Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPDRTS.1995.470487","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 25

摘要

为在硬实时分布式计算系统中运行的任务找到可行的调度通常是np困难的。本文描述了一种基于进化策略的启发式算法。我们的结果表明，进化策略可以在很短的时间内找到可行的时间表(假设它们存在)。

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

查看原文本刊更多论文

Scheduling tasks in real-time systems using evolutionary strategies

Finding feasible schedules for tasks running in hard, real-time distributed computing systems is generally NP-hard. This paper describes a heuristic algorithm using evolutionary strategies. Our results indicate that the evolutionary strategies can find feasible schedules (assuming they exist) in very short periods of time.<>

求助全文

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

来源期刊

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems

自引率

0.00%

发文量