This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: f are all overloaded. We don’t know anything about the load of nodes before M f . Figure 2 – machine knowledge B = { i  i > f } C = { all other machines not in B } S i = Set of jobs assigned to machine by slow fit to machine i in the set B S i * = Set of jobs assigned to machine by OPT(σ) to machine i in the set B If S i * = S i , then OPT behaved the same as slow fit, so we need to show there is a difference in the sets. Suppose B = { 1, 2, …, M , then all machines are overloaded and this is undesirable. To show that f exists we must show that B is not the set of all machines. Proof of slow fit algorithm CSC 7103 10/8/2009 Page 2 of 2 Static scheduling...
View
Full Document
 Fall '08
 Kannan,R
 Operating Systems, Trigraph, Philosophy of mathematics, Front wheel drive vehicles, slow fit

Click to edit the document details