The rationality of intra-cluster buffer allocation directly affects the efficiency of task scheduling in many-core processor. Here, we propose a coarse-grained dynamic virtual channel based on linked list structure to decouple buffer resources from computing resources for reducing the complexity of task scheduling. The decoupling allows the to-do task to be scheduled to the corresponding processor otherwise be blocked by insufficient buffer. The studies show that the variability of number and depth of dynamic virtual channel improves the parallelism of task scheduling and reduces the average scheduling delay by 11%.
机构:
School of Electric Engineering, North China Electric Power University, Changping District, BeijingSchool of Electric Engineering, North China Electric Power University, Changping District, Beijing
Dong L.
Tu S.
论文数: 0引用数: 0
h-index: 0
机构:
School of Electric Engineering, North China Electric Power University, Changping District, BeijingSchool of Electric Engineering, North China Electric Power University, Changping District, Beijing
Tu S.
Li Y.
论文数: 0引用数: 0
h-index: 0
机构:
China Electric Power Research Institute, Haidian District, BeijingSchool of Electric Engineering, North China Electric Power University, Changping District, Beijing
Li Y.
Pu T.
论文数: 0引用数: 0
h-index: 0
机构:
China Electric Power Research Institute, Haidian District, BeijingSchool of Electric Engineering, North China Electric Power University, Changping District, Beijing