DCOS cluster resource allocation is np-hard
问题 Here in the DCOS documents it is stated that "Deciding where to run processes to best utilize cluster resources is hard, NP-hard in-fact." I don't deny that that sounds right, but is there a proof somewhere? 回答1: Best utilization of resources is variation of bin packaging problem: In the bin packing problem, objects of different volumes must be packed into a finite number of bins or containers each of volume V in a way that minimizes the number of bins used. In computational complexity theory