Titlebook: Assignment Problems in Parallel and Distributed Computing; Shahid H. Bokhari Book 1987 Kluwer Academic Publishers 1987 Partition.Processin

勤勉

gonioscopy

Network Flow Techniques,n assignment problem can be transformed into a network flow problem such that there is a one-to-one correspondence between assignments and cutsets. For the case of two processor problems, the optimal assignment—which corresponds to the minimum weight cutset—can be found very efficiently using any one of several available network flow algorithms.

aesthetician

INTER

978-1-4612-9195-4Kluwer Academic Publishers 1987

backdrop

詞匯記憶方法

Introduction,interconnected computers so that program activity moves among processors as execution proceeds. The program may be serial (only one module active on one processor at a time) or parallel (several modules concurrently active on several processors). The assignment problem deals with the question of ass

Keshan-disease

BUCK

入會(huì)

Shortest Path Techniques,he graph of a modular program is constrained in certain ways, it is possible to find the optimal assignment over a system made up of any number of processors in polynomial time. When the graph is constrained to be a tree, a shortest tree algorithm developed by Bokhari (81b) yields the optimal assign

Anthology