Parlea: Difference between revisions
insert logo |
information |
||
| Line 1: | Line 1: | ||
[[File:{{#setmainimage:Default water.jpg|1187×173px}}|alt=water image|center|frameless]] | [[File:{{#setmainimage:Default water.jpg|1187×173px}}|alt=water image|center|frameless]] | ||
[http://parlea.ru/boinctest/ '''''Parlea'''''] is a '''''[[wikipedia:Volunteer computing|volunteer | [http://parlea.ru/boinctest/ '''''Parlea'''''] is a '''''[[wikipedia:Volunteer computing|volunteer computing]]''''' project that needs your help to solve the Orthogonal Diagonal Latin Square (ODLS) problem. | ||
== Why Parlea? == | == Why Parlea? == | ||
The project was created as part of a final qualifying work.[https://parlea.ru/boinctest/about.php] | |||
== Goal == | == Goal == | ||
Parlea is a volunteer computing benchmark project that aims to investigate the efficiency and behavior of mobile devices as compute nodes on the BOINC platform to solve the Orthogonal Diagonal Latin Square (ODLS) problem. | |||
== Methods == | == Methods == | ||
A computational application based on one of the tasks of the RakeSearch project allows one to reconstruct complete orthogonality graphs of individual pairs of mutually orthogonal DLKs. The result should be a full-fledged project that works effectively with mobile devices, on which large computational experiments can be carried out. | |||
== Project team / Sponsors == | == Project team / Sponsors == | ||
NUST MISIS Institute, Department of Engineering Cybernetics | |||
Student Dolgov Andrey Andreevich | |||
Scientific supervisor Associate Professor, Ph.D. Kurochkin Ilya Ilyich | |||
Revision as of 03:30, 1 May 2024
[[File:{{#setmainimage:Default water.jpg|1187×173px}}|alt=water image|center|frameless]]
Parlea is a volunteer computing project that needs your help to solve the Orthogonal Diagonal Latin Square (ODLS) problem.
Why Parlea?
The project was created as part of a final qualifying work.[1]
Goal
Parlea is a volunteer computing benchmark project that aims to investigate the efficiency and behavior of mobile devices as compute nodes on the BOINC platform to solve the Orthogonal Diagonal Latin Square (ODLS) problem.
Methods
A computational application based on one of the tasks of the RakeSearch project allows one to reconstruct complete orthogonality graphs of individual pairs of mutually orthogonal DLKs. The result should be a full-fledged project that works effectively with mobile devices, on which large computational experiments can be carried out.
Project team / Sponsors
NUST MISIS Institute, Department of Engineering Cybernetics Student Dolgov Andrey Andreevich Scientific supervisor Associate Professor, Ph.D. Kurochkin Ilya Ilyich