多处理器系统的比例(m,k)稳定调度

Proceedings of the 9th Balkan Conference on Informatics Pub Date : 2019-09-26 DOI:10.1145/3351556.3351579

Ivaylo Atanassov

{"title":"多处理器系统的比例(m,k)稳定调度","authors":"Ivaylo Atanassov","doi":"10.1145/3351556.3351579","DOIUrl":null,"url":null,"abstract":"This paper introduces a multiprocessor scheduling algorithm for (m,k)-firm tasks. Firm task sets allow limited deadline misses and therefore the load factor of the task set can be greater than one. Many algorithms exist but most of them concern uniprocessor scheduling. The current paper blends the classical Distance Based Priority (DBP) scheduling algorithm and multiprocessor PFair into pfair-based multiprocessor (m,k)-firm scheduling algorithm.","PeriodicalId":126836,"journal":{"name":"Proceedings of the 9th Balkan Conference on Informatics","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Proportionate (m,k)-firm Scheduling for Multiprocessor Systems\",\"authors\":\"Ivaylo Atanassov\",\"doi\":\"10.1145/3351556.3351579\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a multiprocessor scheduling algorithm for (m,k)-firm tasks. Firm task sets allow limited deadline misses and therefore the load factor of the task set can be greater than one. Many algorithms exist but most of them concern uniprocessor scheduling. The current paper blends the classical Distance Based Priority (DBP) scheduling algorithm and multiprocessor PFair into pfair-based multiprocessor (m,k)-firm scheduling algorithm.\",\"PeriodicalId\":126836,\"journal\":{\"name\":\"Proceedings of the 9th Balkan Conference on Informatics\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 9th Balkan Conference on Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3351556.3351579\",\"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 9th Balkan Conference on Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3351556.3351579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

介绍了一种求解(m,k)个公司任务的多处理机调度算法。固定的任务集允许有限的截止日期错过，因此任务集的负载系数可以大于1。目前存在许多算法，但大多数都是关于单处理器调度的。本文将经典的基于距离优先级(DBP)调度算法和多处理器PFair算法融合为基于PFair的多处理器(m,k)-firm调度算法。

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

查看原文

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

本刊更多论文

Proportionate (m,k)-firm Scheduling for Multiprocessor Systems

This paper introduces a multiprocessor scheduling algorithm for (m,k)-firm tasks. Firm task sets allow limited deadline misses and therefore the load factor of the task set can be greater than one. Many algorithms exist but most of them concern uniprocessor scheduling. The current paper blends the classical Distance Based Priority (DBP) scheduling algorithm and multiprocessor PFair into pfair-based multiprocessor (m,k)-firm scheduling algorithm.

求助全文

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

来源期刊

Proceedings of the 9th Balkan Conference on Informatics

自引率

0.00%

发文量