arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1505.04693cs.DS
收藏

分散实时的任务的分区多处理器固定优先级调度

Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks

Jian-Jia Chen

摘要:

分区多处理机调度是一种将实时的【形】任务静态分配和分区到相同的多处理机系统上的方法。本文研究了偶发实时的【形】系统的固定优先级分区多处理机调度问题,其中每个处理机采用截止时间单调调度。在本文之前,最著名的结果是Fisher,Baruah和Baker的加速因子$4-\frac{2}{M}$和$3-\frac{1}{M}$的任意截止期和有约束的截止期偶发实时的【形】任务系统,分别,其中$M$是处理器的数量。我们表明,贪婪的映射策略有一个加速因子$3-\frac{1}{M}$时,考虑任务系统的任意期限。这样的因子适用于多项式时间可验证性测试和指数时间(精确)可验证性测试。此外,我们还改进了加速因子$2.84306$考虑约束期限的任务系统。我们还提供了紧的例子时,在映射阶段的拟合策略是任意的,$M$是足够大的。对于约束和任意截止日期的任务系统,分析结果令人惊讶地表明,使用精确的测试并没有获得理论上的好处(相对于加速因子)的任意拟合策略。

英文摘要:

Partitioned multiprocessor scheduling has been widely accepted in academia and industry to statically assign and partition real-time tasks onto identical multiprocessor systems. This paper studies fixed-priority partitioned multiprocessor scheduling for sporadic real-time systems, in which deadline-monotonic scheduling is applied on each processor. Prior to this paper, the best known results are by Fisher, Baruah, and Baker with speedup factors $4-\frac{2}{M}$ and $3-\frac{1}{M}$ for arbitrary-deadline and constrained-deadline sporadic real-time task systems, respectively, where $M$ is the number of processors. We show that a greedy mapping strategy has a speedup factor $3-\frac{1}{M}$ when considering task systems with arbitrary deadlines. Such a factor holds for polynomial-time schedulability tests and exponential-time (exact) schedulability tests. Moreover, we also improve the speedup factor to $2.84306$ when considering constrained-deadline task systems. We also provide tight examples when the fitting strategy in the mapping stage is arbitrary and $M$ is sufficiently large. For both constrained- and arbitrary-deadline task systems, the analytical result surprisingly shows that using exact tests does not gain theoretical benefits (with respect to speedup factors) for an arbitrary fitting strategy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑