执行时间依赖历史的非抢占调度

2012 24th Euromicro Conference on Real-Time Systems Pub Date : 2012-07-11 DOI:10.1109/ECRTS.2012.38

Björn Andersson, S. Chaki, Dionisio de Niz, B. Dougherty, R. Kegley, Jules White

{"title":"执行时间依赖历史的非抢占调度","authors":"Björn Andersson, S. Chaki, Dionisio de Niz, B. Dougherty, R. Kegley, Jules White","doi":"10.1109/ECRTS.2012.38","DOIUrl":null,"url":null,"abstract":"Consider non-preemptive fixed-priority scheduling of arbitrary-deadline sporadic tasks on a single processor assuming that the execution time of a job J depends on the actual schedule (sequence) of jobs executed before J. We present exact schedulability analysis for such a system.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Non-preemptive Scheduling with History-Dependent Execution Time\",\"authors\":\"Björn Andersson, S. Chaki, Dionisio de Niz, B. Dougherty, R. Kegley, Jules White\",\"doi\":\"10.1109/ECRTS.2012.38\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consider non-preemptive fixed-priority scheduling of arbitrary-deadline sporadic tasks on a single processor assuming that the execution time of a job J depends on the actual schedule (sequence) of jobs executed before J. We present exact schedulability analysis for such a system.\",\"PeriodicalId\":425794,\"journal\":{\"name\":\"2012 24th Euromicro Conference on Real-Time Systems\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 24th Euromicro Conference on Real-Time Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECRTS.2012.38\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 24th Euromicro Conference on Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECRTS.2012.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

假设作业J的执行时间取决于在J之前执行的作业的实际调度(顺序)，考虑在单个处理器上任意截止日期零星任务的非抢占式固定优先级调度。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Non-preemptive Scheduling with History-Dependent Execution Time

Consider non-preemptive fixed-priority scheduling of arbitrary-deadline sporadic tasks on a single processor assuming that the execution time of a job J depends on the actual schedule (sequence) of jobs executed before J. We present exact schedulability analysis for such a system.

求助全文

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

来源期刊

2012 24th Euromicro Conference on Real-Time Systems

自引率

0.00%

发文量

期刊最新文献

Deriving Monitoring Bounds for Distributed Real-Time Systems Schedulability Analysis of Periodic Tasks Implementing Synchronous Finite State Machines A Sensitivity Analysis of Two Worst-Case Delay Computation Methods for SpaceWire Networks Measurement-Based Probabilistic Timing Analysis for Multi-path Programs Supporting Nested Locking in Multiprocessor Real-Time Systems