The scheduling problem of arbitrary task graphs to distributed multiprocessors is generally NP-complete even with simplifying assumptions.

• 一般而言,分布式多处理机上的任意任务图的调度问题即使做了简化假设后依然是NP完全的。