PDA

View Full Version : Rectilinear Linear Crossing


strates
21st July 2006, 12:29 AM
I haven't seen this one mentioned here, so I am posting about it.

It is weblinked here http://dist.ist.tugraz.at/cape5//

It has parsable stats, it accepts new members, and it is active.

Some basic background info was posted by Petrusborder on the Team Anandtech forums. I have reproduced it here for your convience.

Om a more serious notes - I'll report any problems, crashes, hang-ups here and we will see how things are:

1. Just now a total of 260 crunchers ...
2. ... and 59 teams
3. the workunits take anything from 0.17 seconds to over > 50 hours - depending on computer. Short WUs are much more common - long WUs are not common at all (see below).
4. 82 WUs downloaded take 352 kBytes HD-space ...
5. ... the crunching application 332 kBytes, additional files about 25 kBytes
6. Uploads about 4 - 10 kBytes, downloads about the same.
7. The admin of this projects responds to posts in the forum quite often, very friendly.

Here is the forum: (http://dist.ist.tugraz.at/cape5/forum_index.php)
quote:
1) Our web is not finished yet. I leave the explanation of the project's purpose to Oswin who is deeply involved in the scientific part. We will create an extra page for that next week.

2) 550 000 WU's will reach for about 40 days, right. But this project will never die, we will just replace the application and the workunits. I can guarantee that there will never be enough computing power to fit our needs. quote:
We have extremely short WU's as well as extremely long ones and this is absolutely unpredictable. Also the algorithm has no chance to estimate how much work is left. This is the reason why we don't update the percent-done-value.
At the moment my P4 3.0 Ghz computes a WU since 53 hours. But such long WU's do not occur often. Petrus' comment:
The main problem seems to be that there seems no way an algorythm can predict how long a WU takes to crunch. Therefore a comp may download a lot of WUs, after some time start to crunch a long WU and the dead-line for completion may pass without the WUs getting crunched.
The admins have prolonged the deadline, now it is 8 - 10 days. There are still a lot of the old WUs with a two-day-deadline around ... and there you can hit a snag (see above) quite quickly.

I would say that this project is a still public beta-project.

And finally, a link to what the project is about: http://dist.ist.tugraz.at/cape5//why.html

Let me know if any more information is required.

Respectfully,
Strates

wyles
28th July 2006, 02:39 AM
Rag?
Rusty?
Whaddya think?

russkris
28th July 2006, 02:52 AM
It all comes down to gt people to post about how this project proforms....

Toutouf
5th August 2006, 10:10 AM
No prob for me. Runs fine.:beep:

russkris
5th August 2006, 10:13 AM
The latest problem - Adminor anyone wont reply to my post..

russkris
7th August 2006, 03:55 AM
http://dist.ist.tugraz.at/cape5/rcnlogo.png
nice new logo....:D

They replied and looks like they are happy for it to be added

Toutouf
7th August 2006, 09:55 PM
Add it !

wyles
8th August 2006, 04:43 AM
Rusty - is this one up your alley or does it need LB?

russkris
8th August 2006, 04:54 AM
Nope.. Rag's and myself can add BOINC projects.. but yourself and Lb will have to add non-BOINC projects...

russkris
3rd January 2007, 02:28 AM
Would this Project fit into Physical Science?

Webmaster Yoda
3rd January 2007, 07:25 AM
I'd say it is a mathematical project:

"The main goal of the current project is to use sophisticated mathematical methods (abstract extension of order types) to determine the rectilinear crossing number for small values of n."

...and...

"Many questions in computational and combinatorial geometry are based on finite sets of points in the Euclidean plane. Several problems from graph theory also fit into this framework, when edges are restricted to be straight. A typical question is the prominent problem of the rectilinear crossing number (related to transport problems and optimization of print layouts for instance): What is the least number of crossings a straight-edge drawing of the complete graph on top of a set of n points in the plane obtains? Here complete graph means that any pair of points is connected by a straight-edge. Moreover we assume general position for the points, i.e., no three points lie on a common line."

russkris
3rd January 2007, 08:58 PM
Excellent, thanks mate