Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption
Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption
复制标题
DOI：
10.1145/2739954
复制
发表时间：
2015-04
期刊：
影响因子：
--
通讯作者：
Robert I. Davis;A. Burns;J. Marinho;Vincent Nélis;Stefan M. Petters;M. Bertogna
中科院分区：
文献类型：
--
作者：
Robert I. Davis;A. Burns;J. Marinho;Vincent Nélis;Stefan M. Petters;M. Bertogna
本文介绍了针对均质多处理器系统的延期固定优先级计划（GFPD）的全球固定优先级调度分析。 GFPD是全球固定优先级预先计划（GFPPS）和全球固定优先级非首选项调度（GFPN）的超集。我们展示了如何使用GFPD通过适当选择优先级分配和最终非抢先区域长度来提高可计划性，并提供以这种方式优化调度性的算法。通过实验评估，我们比较了使用全局方法：GFPD，GFPPS和GFPN的多处理器调度的性能，以及在每个处理器上使用FPD，FPPS和FPN的分区方法。
This article introduces schedulability analysis for Global Fixed Priority Scheduling with Deferred Preemption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of Global Fixed Priority Preemptive Scheduling (gFPPS) and Global Fixed Priority Nonpreemptive Scheduling (gFPNS). We show how schedulability can be improved using gFPDS via appropriate choice of priority assignment and final nonpreemptive region lengths, and provide algorithms that optimize schedulability in this way. Via an experimental evaluation we compare the performance of multiprocessor scheduling using global approaches: gFPDS, gFPPS, and gFPNS, and also partitioned approaches employing FPDS, FPPS, and FPNS on each processor.