{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:43:22Z","timestamp":1775054602934,"version":"3.50.1"},"reference-count":23,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1134\/s0361768822020086","type":"journal-article","created":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T01:02:51Z","timestamp":1650416571000},"page":"90-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Supercomputer Environment for Recursive Matrix Algorithms"],"prefix":"10.1134","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9698-6374","authenticated-orcid":false,"given":"G. I.","family":"Malaschonok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7035-9447","authenticated-orcid":false,"given":"A. A.","family":"Sidko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2022,4,20]]},"reference":[{"key":"3656_CR1","doi-asserted-by":"crossref","unstructured":"Dongarra, J., With extreme scale computing the rules have changed. Mathematical software, ICMS 2016, Proc. of the 5th Int. Congress, Greuel, V, Koch, T., Paule, P., and Sommese, A., Eds. Springer, Lect. Notes. Comput. Scie., 2016, vol. 9725, pp. 3\u20138.","DOI":"10.1007\/978-3-319-42432-3_1"},{"key":"3656_CR2","unstructured":"HDFS: Hadoop distributed file system. \nhttp:\/\/hadoop.apache.org\/."},{"key":"3656_CR3","doi-asserted-by":"crossref","unstructured":"Malaschonok, G.I. and Ilchenko, E.A., Recursive matrix algorithms in commutative domain for cluster with distributed memory, 2018 \n               Ivannikov Memorial Workshop (IVMEM), Yerevan, Armenia, 2018, IEEE, 2019, pp. 40\u201347. arXiv:1903.04394.","DOI":"10.1109\/IVMEM.2018.00015"},{"key":"3656_CR4","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V., Gaussian elimination is not optimal, Numer. Math., 1969, vol. 13, pp. 354\u2013356.","journal-title":"Numer. Math."},{"key":"3656_CR5","unstructured":"OpenMP 4.0 Complete Specifications, 2013. \nhttp:\/\/www.openmp.org\/wp-content\/uploads\/OpenMP4.0.0.pdf"},{"key":"3656_CR6","unstructured":"Agullo, E., Aumage, O., Faverge, M., Furmento, N., Pruvost, F., Sergent, M., and Thibault, S., Harnessing supercomputers with a sequential task-based runtime system, 2014, vol. 13, no. 9, pp. 1\u201314."},{"key":"3656_CR7","doi-asserted-by":"publisher","unstructured":"Bauer, M., Treichler, S., Slaughter, E., and Aiken, A., Legion: Expressing locality and independence with logical regions, Int. Conf. for High Performance Computing, Networking, Storage and Analysis, 2012, https:\/\/doi.org\/10.1109\/SC.2012.71.","DOI":"10.1109\/SC.2012.71"},{"key":"3656_CR8","doi-asserted-by":"publisher","unstructured":"Bueno, J., Planas, J., Duran, A., Badia R.M., Martorell, X., Ayguade, E., and Labarta, J., Productive programming of GPU clusters with OmpSs, Proc. of the 2012 IEEE 26th International Parallel andDistributed Processing Symposium, IPDPS \n               2012, pp. 557\u2013568. https:\/\/doi.org\/10.1109\/IPDPS.2012.58.","DOI":"10.1109\/IPDPS.2012.58"},{"key":"3656_CR9","doi-asserted-by":"publisher","unstructured":"Dokulil, J., Sandrieser, M., and Benkner, S., Implementing the open community runtime for shared-memory and distributed-memory systems, Proc. of the 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP \n               2016, pp. 364\u2013368. https:\/\/doi.org\/10.1109\/PDP.2016.81.","DOI":"10.1109\/PDP.2016.81"},{"key":"3656_CR10","volume-title":"Parallel algorithms of computer algebra, Proc. of the Institute for System Programming","author":"G.I. Malashonok","year":"2004","unstructured":"Malashonok, G.I., Avetisyan, A.I., Valeev, Yu.D., and Zuev, M.S., Parallel algorithms of computer algebra, Proc. of the Institute for System Programming, Ivannikov, V.P., Ed., Moscow: ISP RAS, 2004, pp. 169\u2013180."},{"key":"3656_CR11","unstructured":"Yarkhan, A., Dynamic task execution on shared and distributed memory architectures, 2012. \nhttp:\/\/trace.tennessee.edu\/utk."},{"key":"3656_CR12","doi-asserted-by":"publisher","unstructured":"Bosilca, G., Bouteiller, A., Danalis, A., Faverge, M., Haidar, A., Herault, T., Kurzak, J., Langou, J., Lemarinier, P., Ltaief, H., et al., Flexible development of dense linear algebra algorithms on massively parallel architectures with DPLASMA, IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, 2011. https:\/\/doi.org\/10.1109\/ipdps.2011.299","DOI":"10.1109\/ipdps.2011.299"},{"key":"3656_CR13","doi-asserted-by":"publisher","unstructured":"Bosilca, G., Bouteiller, A., Danalis, A., Faverge, M., Herault, T., and Dongarra, J., PaRSEC: A programming paradigm exploiting heterogeneity for enhancing scalability, Comput. Sci. Eng., 2013, vol . 99, p. 1. https:\/\/doi.org\/10.1109\/MCSE.2013.98","DOI":"10.1109\/MCSE.2013.98"},{"key":"3656_CR14","doi-asserted-by":"crossref","unstructured":"Hoque, R., Herault, T., Bosilca, G., and Dongarra, J., Dynamic Task discovery in PaRSEC-A data-flow task-based runtime, Proc. of the 8th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems, ScalA17, 2017, Denver, CO, USA.","DOI":"10.1145\/3148226.3148233"},{"key":"3656_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jpdc.1996.0051","volume":"34","author":"S. K. S. Gupta","year":"1996","unstructured":"Gupta, S. K. S., Huang, C.-H., Sadayappan, P., and Johnson, R.W., A framework for generating distributed-memory parallel programs for block recursive algorithms, J. Parallel Distributed Comput., 1996, vol. 34, pp. 137\u2013153.","journal-title":"J. Parallel Distributed Comput."},{"key":"3656_CR16","doi-asserted-by":"publisher","DOI":"10.1109\/ICPPW.2002.1039783","volume-title":"A programming methodology for designing block recursive algorithms on various computer networks","author":"M.-H. Fan","year":"2002","unstructured":"Fan, M.-H., Huang, C.-H., and Chung, Y.-C., A programming methodology for designing block recursive algorithms on various computer networks, 2002, pp.\u00a0607\u2013614. https:\/\/doi.org\/10.1109\/ICPPW.2002.1039783"},{"key":"3656_CR17","first-page":"7","volume":"36","author":"K. Shvachko","year":"2011","unstructured":"Shvachko, K., Apache Hadoop, The Scalability Update, 2011, vol. 36, no. 3, pp. 7\u201313.","journal-title":"The Scalability Update"},{"key":"3656_CR18","unstructured":"Malashonok, G.I. and Valeev,Y.D., The control of parallel computations in recursive symbolic-numerical algorithms, Proc. PaVt\u20192008, St.-Petersburg, pp. 153\u2013165. ISBN 978-5-696-03720-2. \nhttp:\/\/omega.sp.susu.ru\/books\/conference\/PaVT2008\/ papers\/full_papers\/016.pdf"},{"key":"3656_CR19","first-page":"25","volume":"1","author":"G. Malaschonok","year":"2018","unstructured":"Malaschonok, G. and Sidko, A., Distributed computing: DAP-technology for parallelizing recursive algorithms. Scientific notes of NaUKMA, Comput. Sci., 2018, vol. 1, pp. 25\u201332.","journal-title":"Comput. Sci."},{"key":"3656_CR20","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75755-9_67","volume-title":"Three algorithms for Cholesky factorization on distributed memory using packed storage, Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2006","author":"F.G. Gustavson","year":"2007","unstructured":"Gustavson, F.G., Karlsson, L., and Kagstrom, B., Three algorithms for Cholesky factorization on distributed memory using packed storage, Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2006, Kagstrom, B., Elmroth, E., Dongarra, J., and Wasniewski, J., Eds., Lect. Notes Comput. Sci., 2007, vol. 4699. https:\/\/doi.org\/10.1007\/978-3-540-75755-9_67"},{"key":"3656_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Schonhage","year":"1971","unstructured":"Schonhage, A. and Strassen, V., Schnelle Multiplikation grosser Zahlen, Computing, 1971, vol. 7, pp. 281\u2013292.","journal-title":"Computing"},{"key":"3656_CR22","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00450-012-0217-1","volume":"28","author":"T. Heller","year":"2013","unstructured":"Heller, T., Kaiser, H., and Iglberger, K., Application of the ParalleX execution model to stencil-based problems, Comput. Sci. Res. Development, 2013, vol. 28, no.\u00a02\u20133, pp. 253\u2013261. https:\/\/doi.org\/10.1007\/s00450-012-0217-1","journal-title":"Comput. Sci. Res. Development"},{"key":"3656_CR23","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/140989716","volume":"37","author":"M. Tillenius","year":"2015","unstructured":"Tillenius, M., SuperGlue: A shared memory framework using data versioning for dependency-aware task-based parallelization, SIAM J. Sci. Comput., 2015, vol.\u00a037, no. 6, pp. 617\u2013C642. https:\/\/doi.org\/10.1137\/140989716","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768822020086.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768822020086","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768822020086.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:43:09Z","timestamp":1775011389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768822020086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["3656"],"URL":"https:\/\/doi.org\/10.1134\/s0361768822020086","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]},"assertion":[{"value":"30 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}