Re: Process migration strategy

On 12:25 Thu 29 Jun     , Evan Hisey wrote:
>   Class time, please. 

;-) No, you don't want to, believe me. The long answer would take about 40h of compressed math lectures (including an introduction into linear programming (aka linear optimization)). 

> What exactly is the Hungarina method? (Note, math is not my strong suit)

The short answer, however, is that the Hungarian method is an algorithm which can be applied to solve certain kinds of optimization problems (see http://en.wikipedia.org/wiki/Hungarian_algorithm ). 

But my post was rather of theoretical interest as I'm not sure I you can actually imply that our actual scheduling problem can (because of lack of information about the users future actions (i.e. 
stating new processes, killing old ones)) be reduced to an assignment problem. If not then we'd probably still have something like the original, general scheduling problem (which is indeed NP 
hard). 

If I was about to implement some oM schduling scheme, I'd stick to the simplest thing that might possibly work (just as Moshe pointed out) and keep that as long until someone someone puts a heap of 
benchmark data in front of my nose and says: "that reeks of shit" ;-)

Greets
-Andreas

Using Tomcat but need to do more? Need to support web services, security?
Get stuff done quickly with pre-integrated technology to make your job easier
Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo
http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642

_______________________________________________
openMosix-devel mailing list
openMosix-devel-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f@public.gmane.org
https://lists.sourceforge.net/lists/listinfo/openmosix-devel

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.4 (GNU/Linux)

iD8DBQFEpCw9xQzSAzXqsyYRAk4yAJ41Id8+CU+l00uw/4GKGovQcdbOewCbB+wd
CNKfYCi5ZuekcS3rLFHSvbw=
=6ngd
-----END PGP SIGNATURE-----