自组织资源调度中时间相关任务的排序

2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops Pub Date : 2011-03-28 DOI:10.1109/ISORCW.2011.26

Mathias Pacher, U. Brinkschulte

{"title":"自组织资源调度中时间相关任务的排序","authors":"Mathias Pacher, U. Brinkschulte","doi":"10.1109/ISORCW.2011.26","DOIUrl":null,"url":null,"abstract":"We present a framework to order time-dependent tasks with respect to self-organized resource scheduling. The focus is to check if a given task set is executable at all, and in this case we present algorithms to compute a ordering for its tasks.","PeriodicalId":126022,"journal":{"name":"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Ordering of Time-Dependent Tasks for Self-Organized Resource Scheduling\",\"authors\":\"Mathias Pacher, U. Brinkschulte\",\"doi\":\"10.1109/ISORCW.2011.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a framework to order time-dependent tasks with respect to self-organized resource scheduling. The focus is to check if a given task set is executable at all, and in this case we present algorithms to compute a ordering for its tasks.\",\"PeriodicalId\":126022,\"journal\":{\"name\":\"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISORCW.2011.26\",\"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 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISORCW.2011.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

提出了一种基于自组织资源调度的时间相关任务排序框架。重点是检查给定的任务集是否可执行，在本例中，我们提供算法来计算其任务的排序。

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

查看原文本刊更多论文

Ordering of Time-Dependent Tasks for Self-Organized Resource Scheduling

We present a framework to order time-dependent tasks with respect to self-organized resource scheduling. The focus is to check if a given task set is executable at all, and in this case we present algorithms to compute a ordering for its tasks.

求助全文

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

来源期刊

2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops

自引率

0.00%

发文量