Login / Signup

Toward Minimum WCRT Bound for DAG Tasks Under Prioritized List Scheduling Algorithms.

Shuangshuang ChangRan BiJinghao SunWeichen LiuQi YuQingxu DengZonghua Gu
Published in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2022)
Keyphrases
  • scheduling algorithm
  • computational grids
  • response time
  • upper bound
  • lower bound
  • resource requirements
  • worst case
  • directed acyclic graph
  • grid environment
  • load balancing
  • low complexity
  • real time database systems