Theoretical foundations of software systems
Research Article
Scheduling for solving a search problem in a Desktop Grid
Evgeny Ivashko1
, Ilya Chernov2
| 1,2 | Institute of Applied Mathematical Research KarRC of RAS |
| 1 |
|
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-2020
68Q85; 68M20, 68P10For 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.