Re: Process migration strategy
"Evan Hisey" <[email protected]>
| Newsgroups | gmane.linux.cluster.openmosix.devel |
|---|---|
| Message-ID | <[email protected]> |
Andreas- Class time, please. What exactly is the Hungarina method? (Note, math is not my strong suit) Evan On 6/29/06, Andreas Schäfer <[email protected]> wrote: > On 11:54 Thu 29 Jun , Moshe Bar wrote: > > Dynamic process migration is a very difficult subject and a typical NP > > problem. If we had a simple round robin ( as I already pointed out elsewhere > > in this mailing list) that would be more than enough for a lot of use cases. > > Well, is it NP hard? Granted, if you consider the overall scheduling, > knowing all the incoming jobs and available nodes in advance -- that > will be NP hard. > > But I always thought, an optimal algorithm to solve the process > migration problem for unknown workloads could be easily derived from > the problems reformulation as an assignment problem. For this the > Hungarian method can yield an optimal solution in (currently, IIRC) > O(n^3). > > Just my $0.02 ;-) > -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 > > > > 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