DPDS:一种处理资源调度算法

DPDS:processing resources scheduling algorithm

提出一种新颖的面向高级网络处理器(NP)的处理资源调度算法,称为基于复制的部分动态调度算法(Duplication-base Partial Dynamic Scheduling,DPDS),结合部分动态映射及任务复制策略,以改善NP的性能。DPDS从多个方面与已有算法不同,如处理单元是异构、全连通、多线程的,应用被分解为以持续数据包为输入的DAG任务,调度在初始化和运行时阶段均可调整。实验结果显示本算法比不具有动态复制阶段的算法在最大平均吞吐量上高出30%左右。

This paper proposes a novel processing resources scheduling algorithm oriented advanced Network Processors（NP）,called Duplication-base Partial Dynamic Scheduling（DPDS）.It aims to improve the NP performance by combining the strategies of partial dynamic mapping and task duplication.DPDS differs from existing solutions in several aspects,e.g.,the processing elements are heterogeneous,fully-connected,and multi-threading,the application is decomposed into DAG tasks with continuous data-packets,and scheduling is conducted at both of initialization and run-time.Experimental results show the algorithm can increase the largest average throughput by about 30% than those without dynamic phase duplication.