multiprocessor allocation

基本解釋

Since the problem to find an optimal allocation of nodes of the dynamic fuzzy semantic network on a multiprocessor system is NP hard.
如何將模糊結(jié)點最優(yōu)分配到并行多處理機的處理器上的問題是NP完全型的。
Allocation groups also help to optimize parallel IO performance on multiprocessor systems, because more than one metadata update can be "in transit" at the same time.
分配組還有助于在多處理器系統(tǒng)上優(yōu)化并行 IO 性能，因為可以同時有多個元數(shù)據(jù)更新處于“在傳輸中”。
One dimensional bin packing problem has many important applications such as multiprocessor scheduling, resource allocation, real world planning, and packing and scheduling optimization problems.
經(jīng)典一維裝箱問題在多處理器調(diào)度、資源分配和日常生活中的計劃、包裝、調(diào)度等優(yōu)化問題中有著極為重要的應(yīng)用。