Dear folks!

We created the first bunch of tasks for new search in rank 10 space. Currently - under Linux x86-64. Renewed search use a new application, runtime increased in several times and new application return more data than previous. If tasks processing is successful tomorrow we add details! :)

Great thanks for Daniel from BOINC@Poland for attention, scientific critical perception and help!

Hmm. I seem to have gotten 32 new Rank 10 tasks for Windows, so we're not left out :)

---

It's a problem! As I see - on many computers using the old Windows application of version 1.0!
I cancel tasks. Hope that today we create new bunch with a new application.

Steve, thank you!

We made application for Windows x86-64, and regenerate first bunch of tasks.

One task is predicted to finish within 6hrs on i7-4770. Is this right time?

---

Hello Hal!

One task is predicted to finish within 6hrs on i7-4770. Is this right time?

Yes, it normal. Computation time for each workunit and task must increased.

Hello Hal!

One task is predicted to finish within 6hrs on i7-4770. Is this right time?

Yes, it normal. Computation time for each workunit and task must increased.

Thanks hoarfrost. I interpreted "runtime increased in several times" in your first post as tasks will run faster :-D.
I guess I needed more morning coffee today.

BTW could this project be multi-threaded like Amicable Numbers?

---

BTW could this project be multi-threaded like Amicable Numbers?

In fact (as in many (but not all!) other cases of Distrbuted Computing) this achieved by splitting global task on workunits that can be computed in parallel.
In some cases long time of task processing may be uncomfortable, but have a some clear advantages: 1) No problem with tasks cache; 2) Significantly decreased load on server and project database; 3) "Damage" from disappeared computers descrease also.

Is it possible that something is not yet properly adjusted with the virtual credits system?

First of all it appears to me that the credits are very low given run times of sometimes over 23 hrs where for similar tasks in the rank 9 scheme for a given credit run times of 20 to 60 minutes were normal (factor of approx. 23 to 69).
Second, I have a case where almost identical credits are given for tasks which differ by a doubled run time:

https://rake.boincfast.ru/rakesearch/workunit.php?wuid=24534598
https://rake.boincfast.ru/rakesearch/workunit.php?wuid=24534603

Michael.

---

President of Rechenkraft.net.
Fördern, kooperieren und konstruieren statt fordern, konkurrieren und konsumieren.

BTW could this project be multi-threaded like Amicable Numbers?

In fact (as in many (but not all!) other cases of Distrbuted Computing) this achieved by splitting global task on workunits that can be computed in parallel.
In some cases long time of task processing may be uncomfortable, but have a some clear advantages: 1) No problem with tasks cache; 2) Significantly decreased load on server and project database; 3) "Damage" from disappeared computers descrease also.

Fair enough.

PS

I will join Michael H W Weber in question about about credits for R10 works.

---

Is it possible that something is not yet properly adjusted with the virtual credits system?

Michael, Hal, yes, it can be. At this moment canonical results formed for 483 workunits. Not a big number. It is possible that when collected statistics over a large set of results and workunits, dispersion of ratio granted credit and CPU time - will be decreased.

As tell previously, we add some explanations about the new run of R10 search. We expect that "permutational pairs" of rank 10 - are very rare or do not even exist. In this case, 99.999% (or even 100%) results from computers contain information about a number of processed squares only. Not interesting and can hide potential errors in the algorithm. In a new application for the current run, we add to results files not the only number of processed squares and orthogonal pairs (if they are found), but partial orthogonal pairs also.
Sample of similar pair from the result, processed on my computer:

Top left square - a diagonal Latin square created during sequential generation. Top right square - generated from the first square by rows permutation. Bottom square with a two-digit number in each cell - Graeco-Latin square - the combination of two bottom squares, which were superimposed on each other. If top squares are orthogonal, all 100 two-digit numbers from Graeco-Latin square was distinct. But in this case, it is not. Only 64 values inside cells - unique (they marks by black), and other 17 numbers - present in this square more than once. If we count of distinct numbers in the bottom square we will get 81 - this is the degree of orthogonality of top pair of squares!
In the new run, we place in results all pairs with a degree of orthogonality > 80. And now, in each confirmed result we see a several or even tens partially orthogonal pairs - sometimes more than 30, for example. May be each result contain interesting information. Not ODLS, but interesting also.

Thank you for participation!

Since every 10 X 10 Latin square has an embedded 3 X 3 Latin square, could we seed three rows, three columns, and their intersections as the 3 X 3 Latin square?
Could your algorithm be modified to start with this additional information?

---

Since every 10 X 10 Latin square has an embedded 3 X 3 Latin square, could we seed three rows, three columns, and their intersections as the 3 X 3 Latin square?
Could your algorithm be modified to start with this additional information?

Hello Rudy! I placed the answer in your thread Question about 10 X 10 squares.

Hello Rudy! I placed the answer in your thread Question about 10 X 10 squares.

Could you please also move this post to the other discussion thread to have everything in one place?

Michael.

---

President of Rechenkraft.net.
Fördern, kooperieren und konstruieren statt fordern, konkurrieren und konsumieren.

Hello Rudy! I placed the answer in your thread Question about 10 X 10 squares.

Could you please also move this post to the other discussion thread to have everything in one place?

This post was made before start of the target topic and I made a copy.

Long Running for sure over 9 Hours on an RYZEN 7 1800X and that is with SMT Off.
Way to long for me.

Long Running for sure over 18 Hours on an RYZEN 7 2700X !

Yes. Some tasks are really very long.

yes and only 6,698 points for 16 threads
best regard