| Fare | and currently using ad-hoc functions to generate what task to assign the next available worker |
| michaelw | Fare: are you asking about load balancing? |
| rahul | michaelw: no, fully distributed computing erlang-esque |
| Dazhbog | oo |
| michaelw | rahul: um |
| Fare | michaelw, yes |
| rahul | I guess you could _call_ it load-balancing, but it's not the same as an http load balancer unless you think of the web servers requesting the farm for sub-requests |
| piso | froydnj: in tiger.lisp, you've got some calls to LIST that take more arguments than CALL-ARGUMENTS-LIMIT is required to accept |
| michaelw | rahul: i did not say http at all. load balancing is a general concept. |
| rahul | michaelw: right, http as an example request protocol |
| piso | froydnj: could you replace (list ...) with '(... ) ? (or do you modify those lists?) |
| rahul | michaelw: most load balancers don't shift subtasks around the farm |
| Fare | so, cells and compute-class. Thanks |
| rahul | an entire request is handled by a single physical server |
| xirie | Fare: http://common-lisp.net/project/computed-class/ |
| froydnj | piso: in the MAKE-ARRAY calls for the sboxes? |
| michaelw | rahul: please point me to some of those load balancers |
| rahul | michaelw: which ones? |
| michaelw | Fare: googling for load balancing and/or control theory might point you in the right direction. usually some prediction of the amount of work to be expected is needed rahul: of the "most" you mentioned |
| cmm | is computed-class a fork of cells or something? |
| attila_lendvai | xirie: did you use computed-class? |
| rahul | michaelw: the F5 http load balancer is the 'typical' one |
| piso | (defparameter tiger-t4 (make-array ... :initial-contents (list ...))) |
| attila_lendvai | cmm: it's written from scratch |
| froydnj | piso: ok. yes, those could be changed to quoted lists |
| xirie | attila_lendvai: not yet (have a project due next week), but it looks a lot cleaner than cells. |
| Fare | michaelw: no, I don't need any of that |
| cmm | fork all the way down! :) |
| rahul | Fare: actually, cells only knows what dependencies there are after you compute the result Fare: it only uses dependencies to know when it needs to update |
| piso | froydnj: xcl's CALL-ARGUMENTS-LIMIT is 256 (although maybe there's no good reason for that) |
| Fare | what I need is a simple framework to build "nodes" that depend on other "nodes" for completion, sometimes in parallel, sometimes in series, sometimes with more complex dependencies with new nodes appearing on a need basis, and disappearing when completed |
| michaelw | Fare: a dependency graph and breadth/best-first traversal then? :) |