Login / Signup

A branch-and-bound approach to scheduling of data-parallel tasks on multi-core architectures.

Yang LiuLin MengIttetsu TaniguchiHiroyuki Tomiyama
Published in: Int. J. Embed. Syst. (2020)
Keyphrases
  • branch and bound
  • search algorithm
  • bayesian networks
  • data points
  • lower bound
  • search space
  • cost function
  • np hard
  • parallel processors