优先级约束下基于拓扑排序的周期任务调度算法

2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI) Pub Date : 2011-11-01 DOI:10.1109/URAI.2011.6145920

Si Wan Kim, H. Park

{"title":"优先级约束下基于拓扑排序的周期任务调度算法","authors":"Si Wan Kim, H. Park","doi":"10.1109/URAI.2011.6145920","DOIUrl":null,"url":null,"abstract":"Almost real-time systems are constructed by periodic tasks that have precedence. In this paper, we propose scheduling method and validation algorithm. This method allocate periodic task that have precedence relations for fixed priority using topological sort algorithm. And we validation this algorithm using simple example.","PeriodicalId":385925,"journal":{"name":"2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Periodic task scheduling algorithm under precedence constraint based on topological sort\",\"authors\":\"Si Wan Kim, H. Park\",\"doi\":\"10.1109/URAI.2011.6145920\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Almost real-time systems are constructed by periodic tasks that have precedence. In this paper, we propose scheduling method and validation algorithm. This method allocate periodic task that have precedence relations for fixed priority using topological sort algorithm. And we validation this algorithm using simple example.\",\"PeriodicalId\":385925,\"journal\":{\"name\":\"2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/URAI.2011.6145920\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/URAI.2011.6145920","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

几乎实时系统都是由具有优先级的周期性任务构成的。在本文中，我们提出了调度方法和验证算法。该方法利用拓扑排序算法对具有固定优先级关系的周期任务进行分配。并通过简单的实例验证了该算法的有效性。

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

查看原文本刊更多论文

Periodic task scheduling algorithm under precedence constraint based on topological sort

Almost real-time systems are constructed by periodic tasks that have precedence. In this paper, we propose scheduling method and validation algorithm. This method allocate periodic task that have precedence relations for fixed priority using topological sort algorithm. And we validation this algorithm using simple example.

求助全文

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

来源期刊

2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)

自引率

0.00%

发文量