Homepage Program Systems: Theory and Applications Русская версия
ISSN 2079-3316 Bilingual online scientific Online scientific journal of the Ailamazyan Program System Institute of the Ailamazyan PSI of PSI of Russian Academy of Science of RAS 12+ 
Volume 17 (2026) . Issue 2 (71) . Paper No. 2 (509)

Theoretical foundations of software systems

Research Article

Scheduling for solving a search problem in a Desktop Grid

Evgeny Ivashko1Correspondent author, Ilya Chernov2

1,2Institute of Applied Mathematical Research KarRC of RAS
1 Evgeny Ivashko — Correspondent author ivashko@krc.karelia.ru

Abstract. The article investigates a mathematical model for solving a search problem in Desktop Grid — the enumeration of a certain space of discrete objects to find the single one that satisfies given conditions. Based on previously obtained mathematical results, an optimal search strategy is presented for cases where the computational complexity of the tasks themselves and their rechecks is homogeneous and heterogeneous; a method for constructing a schedule for solving the search problem in Desktop Grid is proposed. An important obtained practical result is the mechanism of dynamic replication, which ensures high available performance. The results of numerical simulations demonstrating the advantages of the proposed schedule are presented. (In Russian).

Keywords: Desktop Grid, search problem, replication, scheduling

MSC-20202020 Mathematics Subject Classification 68Q85; 68M20, 68P10MSC-2020 68-XX: Computer science
MSC-2020 68Qxx: Theory of computing
MSC-2020 68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
MSC-2020 68Mxx: Computer system organization
MSC-2020 68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
MSC-2020 68Pxx: Theory of data
MSC-2020 68P10: Searching and sorting

For citation: Evgeny Ivashko, Ilya Chernov. Scheduling for solving a search problem in a Desktop Grid. Program Systems: Theory and Applications, 2026, 17:2, pp. 83–101. (In Russ.). https://psta.psiras.ru/2026/2_83-101.

Full text of article (PDF): https://psta.psiras.ru/read/psta2026_2_83-101.pdf.

The article was submitted 16.02.2026; approved after reviewing 03.04.2026; accepted for publication 03.04.2026; published online 05.05.2026.

© Ivashko E., Chernov I.
2026
Editorial address: Ailamazyan Program Systems Institute of the Russian Academy of Sciences, Peter the First Street 4«a», Veskovo village, Pereslavl area, Yaroslavl region, 152021 Russia;   Website:  http://psta.psiras.ru Phone: +7(4852) 695-228;   E-mail: ;   License: CC-BY-4.0License text on the Creative Commons site
© Ailamazyan Program System Institute of Russian Academy of Science (site design) 2010–2026