From mboxrd@z Thu Jan 1 00:00:00 1970 Message-ID: <1e02bca77cfa379ac48a1b4830204a78@quanstro.net> To: 9fans@cse.psu.edu Subject: Re: [9fans] cpu(1) design... From: erik quanstrom Date: Fri, 9 Nov 2007 10:57:06 -0500 In-Reply-To: <13426df10711090746l41449933ya48792efc15885b3@mail.gmail.com> MIME-Version: 1.0 Content-Type: text/plain; charset="US-ASCII" Content-Transfer-Encoding: 7bit Topicbox-Message-UUID: f06b19fa-ead2-11e9-9d60-3106f5b1d025 >> >> I was imagining somthing like the load balancing code I have seen for Unix, >> each box multicasts a load estimate regularly and a local daemon picks these up >> and answers "which is the least loaded machine" requests; obviously I also >> imagined a much more elegant solution for a plan9 environment... > > see andrey's thesis. Mount a mon server and you have a file system of > servers. Then you can just read the files, pick the least loaded one, > and run on it. > > Along with the other 400 people who just picked that least-loaded node > but hey, that's the inherent race conditions you get. :-) why not move the decision of who picks up the job to the cpu server? this would solve the race. - erik