Rakesearch
RakeSearch is a BOINC based volunteer computing project that needs your help to process diagonal Latin squares.
Why RakeSearch?[edit | edit source]
- why this topic/object of study?
Goal[edit | edit source]
Investigate the diagonal Latin squares space.
Methods[edit | edit source]
The enormous size of the diagonal Latin squares space makes it unfeasible to enumerate all its objects in reasonable time. Sophisticated search methods and the BOINC platform are essential to meet the computational requirements.
RakeSearch implements an application that picks up separate pairs of mutually orthogonal DLS, which allows reconstruction of full graphs of their orthogonality.
Source code:
Project team / Sponsors[edit | edit source]
hoarfrost. The searchers team, Karelian Research Center of the Russian Academy of Sciences.
Scientific results[edit | edit source]
https://rake.boincfast.ru/rakesearch/publications.php
https://rake.boincfast.ru/rakesearch/graphs.html
Scientific publications[edit | edit source]
- Vatutin, Eduard, Oleg Zaikin, Maxim Manzyuk and Natalia Nikitina. Searching for Orthogonal Latin Squares via Cells Mapping and BOINC-Based Cube-and-Conquer. (2021). DOI: 10.1007/978-3-030-92864-3_38.
- Vatutin, Eduard and Alexey Belyshev. Enumerating the Orthogonal Diagonal Latin Squares of Small Order for Different Types of Orthogonality. (2020). DOI: 10.1007/978-3-030-64616-5_50.
- Ivashko, Evgeny and Natalia Nikitina. Replication of “Tail” Computations in a Desktop Grid Project. (2020). DOI: 10.1007/978-3-030-64616-5_52.
- Manzyuk, Maxim, Natalia Nikitina and Eduard Vatutin. Start-up and the Results of the Volunteer Computing Project RakeSearch. (2019). DOI: 10.1007/978-3-030-36592-9_59.