DOI: 10.17587/prin.14.155-164

Deterministic Model of Information Queries Batch Processing in a Multithreaded Server

R. E. Asratian, Leading Researcher, rubezas@yandex.ru, V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, Moscow, 117997, Russian Federation,

Corresponding author: Ruben E. Asratian, Leading Researcher, V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, Moscow, 117997, Russian Federation, E-mail: rubezas@yandex.ru

The analytical model of processing a batch of similar requests in a multithreaded server is considered. The model is based on the high determinism of the duration of individual stages of request processing and the moments of events leading to the switching of the processor from one processing program thread to another. Unlike other deterministic models based on the theory of schedules, in this case the goal is not to find the optimal distribution of work across processors, but to study the dependence of the main characteristics of the software server (packet processing time, marginal performance) on the characteristics of the request and the size of the batch. The model concerns the situa­tion when distributed system with intensive flows of information queries is developed and special measures to ensure the required performance must be taken. One of these measures is the introduction of batch query processing tools, allowing an array of similar information queries to be processed in a single service call. The introduction of such tools usually allows you to repeatedly increase the rate of processing queries in the system and very often becomes a real «lifesaver» for customers who issue, for example, hundreds of thousands of queries per day or more. It is quite likely that a sequence of ordinary single queries cannot provide a solution, and batch processing simply has no alternative

Keywords: deterministic model, batch queries, batch processing, multithreaded server, multicore server, multithreading

pp. 155–164

For citation:
Asratian R. E. Deterministic Model of Information Queries Batch Processing in a Multithreaded Server, Programmnaya ingeneria, 2023, vol. 14, no. 4, pp. 155—164. DOI: 10.17587/prin.14.155-164. (in Russian).

References:

1. Muter I. Exact algorithms to minimize makespan on single and parallel batch processing machines, European Journal of Operational Research, 2020, vol. 285, no. 2, pp. 470—483. DOI:10.1016/j. ejor.2020.01.065.
2. Ding S., Attenberg J., Baeza-Yates R., Suel T. Batch query processing for web search engines, Proceedings of the fourth ACM international conference on Web search and data mining, NY, ACM, 2011, pp. 137—146. DOI: 10.1145/1935826.1935858.
3. Tannenbaum A., Bos H. Modern Operating Systems, N. J., Pearson Education, 2015, 1136 p.
4. Stevens W., Rago S. Advanced programming in the UNIX environment, Addison-Wesley Professional, 2013, 1032 p.
5. Volosatova T. M., Kiselev I. A., Knyazeva S. V. Multi­threaded processing in POSIX standard, Eastern European Scientific Journal, 2021, no. 12-3, pp. 37—39. DOI: 10.31618/ESSA.2782-1994.2021.3.76.214 (in Russian).
6. Larina T. B., Filipchenko A. S. Experiments with multi­threaded processing in RPA Robin, Information Innovative Technologies: International Scientific-Practical Conference, Prague, Moscow, Association of graduates and employees of AFEA named after prof. Zhukovsky, 2022, pp. 245—252.
7. Tkachenko V. I. Prospects for the development of operating systems, Scientific achievements and innovations: questions of theory and practice: Materials of the XIV All-Russian Scientific and Practical Conference, Rostov-on-Don, September 15, 2022, Rostov-on-Don, Paragraph, 2022, pp. 46—49 (in Russian).
8. Mamonov A.A., Salpagarov S. I. The distributed computing system as a specific case of queueing system, The 5th International Conference on Stochastic Methods (ICSM-5), Moscow, RUDN Uni­versity, 2020, pp. 102—106.
9. Sahakyan V., Vardanyan A. The Queue State for Multiproces­sor System with Waiting Time Restriction, 2019 Computer Science and Information Technologies (CSIT): Revised selected papers, Yerevan, IEEE, 2019, pp. 116—119. DOI: 10.1109/CSITechnol.2019.8895093.
10. Coffman E. G. Computer and job-shop scheduling theory, NY, Wiley, 1976, 299 p.
11. Chernykh K. A., Servakh V. V. Combinatorial structure of optimal solutions to the problem of a single machine with preemption, 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019, Novosibirsk, 2019, pp. 21—26. DOI: 10.1109/OPCS.2019.8880148.
12. Romanova A. A., Servakh V. V. Complexity of cyclic job shop scheduling problem for identical jobs with no-wait constraints, Journal of Applied and Industrial Mathematics, 2019, vol. 13, no. 4, pp. 706—716. DOI: 10.1134/S1990478919040136.
13. Feuerstein S. Oracle PL/SQL Programming, O'Reilly, 2014, 1392 p.
14. Worsley J., Drake J. PostgreSQL for professionals, Saint Petersburg, Piter, 2003, 496 p. (in Russian).
15. Ferrari L., Pirozzi E. Learn PostgreSQL, Birmingham, Packt, 2020, 650 p.