|
From: Pablo C. E. <pab...@gm...> - 2007-05-12 13:21:40
|
Hi Everyone. I need some support from anyone who deeply understand OpenSG clustering algorithms and strategies. Here=B4s the issue: I=B4m working on a big project together with my univers= ity and we have a demand for real time simulations using a lot of geometry (about 1 or 2 million triangles at least) that changes all the time (due to the simulations) and should necessarily run on a cluster. Once we=B4re willing to use OpenSG as the scenegraph (among other things, a= lso because of the clustering native support of OpenSG), my task is to analyze the efficiency of the clustering algorithms and strategies of OpenSG. I nee= d to study what happens behind the magic of OpenSG clustering (how the data i= s transfered, including protocol details, the strategy of data sharing - whether or not the whole geometry is sent every time even if just a small part of it is changed)... I know the first thing I should do in order to get all this information is to open OpenSG source code and to study it (I=B4m doing it by now), but sin= ce my time is VERY short (the report must be ready in 3 days, and the task was assigned to me yesterday), I need any document that can help me to achieve my goal of analyzing things behind OpenSG clustering (hard code details). I need any benchmark document or algorithm analysis document or anything. Any help will be very welcome. Thank you very much. I hope anyone can help me on anything (any explanation about any detail of OpenSG clustering will be very welcome to). |