arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1508.03236cs.DC
收藏

大型多处理机系统上的链式多处理机任务调度

Scheduling Chained Multiprocessor Tasks onto Large Multiprocessor System

T. K. Agrawal, R. Sharma, M. Ghose, A. Sahu

摘要:

本文提出了一种在大型多处理机系统上调度具有链式优先级的多处理机单位时间任务的有效方法。本文提出的最长链最大处理器调度算法对均匀链和单调(非增/非减)链都是最优的,对可拆分和不可拆分的多处理器单位时间任务链都是最优的。证明了调度任意不可拆分多处理器单位时间任务链是NP完全问题。但可拆分多处理机单位时间任务的任意链调度问题是一个有待证明的NP完全问题还是多项式时间内可解的问题。我们已经使用了三种算法(a)最大关键度优先,(b)最长链最大关键度优先和(c)最长链最大处理器优先调度任意链。同时比较了三种调度算法的性能,发现最长链最大值处理器在大多数情况下性能更好。

英文摘要:

In this paper, we proposed an effective approach for scheduling of multiprocessor unit time tasks with chain precedence on to large multiprocessor system. The proposed longest chain maximum processor scheduling algorithm is proved to be optimal for uniform chains and monotone (non-increasing/non-decreasing) chains for both splitable and non-splitable multiprocessor unit time tasks chain. Scheduling arbitrary chains of non-splitable multiprocessor unit time tasks is proved to be NP-complete problem. But scheduling arbitrary chains of splitable multiprocessor unit time tasks is still an open problem to be proved whether it is NP-complete or can be solved in polynomial time. We have used three heuristics (a) maximum criticality first, (b) longest chain maximum criticality first and (c) longest chain maximum processor first for scheduling of arbitrary chains. Also compared performance of all three scheduling heuristics and found out that the proposed longest chain maximum processor first performs better in most of the cases.

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

↑