Scheduling UET-UCT DAGs of Depth Two on Two Processors

2021 22nd International Arab Conference on Information Technology (ACIT)（2021）

引用 1|浏览1

暂无评分

摘要

Given n unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph (DAG), the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two processors in order to minimize the makespan. Several polynomial algorithms in the literature are proposed for special classes of digraphs, but the complexity of solving this problem ...

查看译文

关键词

Schedules,Directed acyclic graph,Sufficient conditions,Program processors,Processor scheduling,Optimal scheduling,Scheduling

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要