Unformatted text preview: If there are more than two processors, and the value of running P on these are not equal, then the cost for this edge is ambiguous. The costs of the severed edges should reflect the cost of running on one processor, but this severing one edge does not define which processor this is. Moreover, with more than two processors, the graph would have to be partitioned into as many components as there are processors, which is beyond basic min-cut. b) An attempt to extend this heuristic would be to have the T-P edge cost equal to 1/(N-1) of the average (or max or min) cost of running T on the other processors (not P). The scaling is needed since N-1 edges from T to the processors will be included in the N-way partition. This approach is likely to overestimate the processing costs (esp. if the cost is infinite for T on more than one processor) or underestimate them (if the min is used)....
View Full Document
This note was uploaded on 01/18/2012 for the course COP 5615 taught by Professor Staff during the Fall '08 term at University of Florida.
- Fall '08
- Operating Systems