{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:01:07Z","timestamp":1757451667721,"version":"3.37.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030058067"},{"type":"electronic","value":"9783030058074"}],"license":[{"start":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T00:00:00Z","timestamp":1546214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-05807-4_48","type":"book-chapter","created":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T23:02:46Z","timestamp":1546210966000},"page":"565-577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Designing a Parallel Programs on the Base of the Conception of Q-Determinant"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4717-0045","authenticated-orcid":false,"given":"Valentina","family":"Aleeva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,31]]},"reference":[{"key":"48_CR1","unstructured":"Aleeva, V.N.: Analysis of parallel numerical algorithms: Preprint No. 590. Novosibirsk, Computing Center of the Siberian Branch of the Academy of Sciences of the USSR (1985)"},{"key":"48_CR2","unstructured":"Ignatyev, S.V.: Definition of parallelism resource of algorithms on the base of the concept of $$Q$$-determinant. In: Scientific Service on the Internet: Supercomputer Centers and Tasks: Proceedings of the International Supercomputer Conference, Novorossijsk, Russia, September 20\u201325, 2010, pp. 590\u2013595. Publishing of the Moscow State University, Moscow (2010)"},{"key":"48_CR3","unstructured":"Svirihin, D.I.: Definition of parallelism resource of algorithm and its effective use for of a finite number of processors. In: Scientific Service on the Internet: the Search for New Solutions: Proceedings of the International Supercomputer Conference, Novorossijsk, Russia, September 17\u201322, 2012, pp. 257\u2013260. Publishing of the Moscow State University, Moscow (2012)"},{"key":"48_CR4","unstructured":"Svirihin, D.I., Aleeva, V.N.: Definition the maximum effective realization of algorithm on the base of the conception of $$Q$$-determinant. In: Parallel Computational Technologies (PCT\u20192013): Proceedings of the International Scientific Conference, Chelyabinsk, Russia, April 1\u20135, 2013, p. 617. Publishing of the South Ural State University, Chelyabinsk (2013)"},{"key":"48_CR5","unstructured":"Aleeva, V.N.: The parallelization of algorithms on the base of the conception of $$Q$$-determinant. In: Groups and Graphs, Algorithms and Automata, 2015: Abstracts of the International Conference and PhD Summer School of the 80th Birthday of Professor Vyacheslav A. Belonogov and of the 70th Birthday of Professor Vitaly A. Baransky (Yekaterinburg, Russia, August 9\u201315, 2015), p. 33. UrFU Publishing house, Yekaterinburg (2015)"},{"key":"48_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-21909-7_1","volume-title":"Parallel Computing Technologies","author":"VN Aleeva","year":"2015","unstructured":"Aleeva, V.N., Sharabura, I.S., Suleymanov, D.E.: Software system for maximal parallelization of algorithms on the base of the conception of Q-determinant. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 3\u20139. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21909-7_1"},{"key":"48_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/3-540-62598-4_136","volume-title":"Numerical Analysis and Its Applications","author":"VV Voevodin","year":"1997","unstructured":"Voevodin, V.V., Voevodin, V.V.: The V-ray technology of optimizing programs to parallel computers. In: Vulkov, L., Wa\u015bniewski, J., Yalamov, P. (eds.) WNAA 1996. LNCS, vol. 1196, pp. 546\u2013556. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/3-540-62598-4_136"},{"key":"48_CR8","unstructured":"Voevodin, V.V., Voevodin, V.V.: Parallel computing. BHV-Petersburg, St. Petersburg (2002). (in Russian)"},{"key":"48_CR9","unstructured":"Open Encyclopedia of Parallel Algorithmic Features. \nhttp:\/\/algowiki-project.org\/en\/Open_Encyclopedia_of_Parallel_Algorithmic_Features"},{"key":"48_CR10","unstructured":"Voevodin, V.V.: Parallel algorithms under the microscope. In: Parallel Computational Technologies (PCT\u20192016): Report on the International Scientific Conference, Arkhangelsk, Russia, March 28\u2013April 1 2016. \nhttp:\/\/omega.sp.susu.ru\/books\/conference\/PaVT2016\/talks\/Voevodin.pdf"},{"key":"48_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-21909-7_4","volume-title":"Parallel Computing Technologies","author":"YL Gurieva","year":"2015","unstructured":"Gurieva, Y.L., Il\u2019in, V.P.: On parallel computational technologies of augmented domain decomposition methods. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 35\u201346. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21909-7_4"},{"issue":"3","key":"48_CR12","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1002\/biot.201400150","volume":"10","author":"DA Suplatov","year":"2015","unstructured":"Suplatov, D.A., Voevodin, V.V., Svedas, V.K.: Robust enzyme design: bioinformatic tools for improved protein stability. Biotechnol. J. 10(3), 344\u2013355 (2015). \nhttps:\/\/doi.org\/10.1002\/biot.201400150","journal-title":"Biotechnol. J."},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Venkata, M.G., Shamis, P., Sampath, R., Graham, R.L., Ladd, J.S.: Optimizing blocking and nonblocking reduction operations for multicore systems: hierarchical design and implementation. In: Proceedings of IEEE Cluster, pp. 1\u20138 (2013)","DOI":"10.1109\/CLUSTER.2013.6702676"},{"key":"48_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-319-21909-7_8","volume-title":"Parallel Computing Technologies","author":"VE Malyshkin","year":"2015","unstructured":"Malyshkin, V.E., Perepelkin, V.A., Schukin, G.A.: Distributed algorithm of data allocation in the fragmented programming system LuNA. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 80\u201385. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21909-7_8"},{"key":"48_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-21909-7_9","volume-title":"Parallel Computing Technologies","author":"VE Malyshkin","year":"2015","unstructured":"Malyshkin, V.E., Perepelkin, V.A., Tkacheva, A.A.: Control flow usage to improve performance of fragmented programs execution. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 86\u201390. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21909-7_9"},{"issue":"10","key":"48_CR16","first-page":"71","volume":"1","author":"AI Legalov","year":"2005","unstructured":"Legalov, A.I.: Functional language for creating architecturally independent parallel programs. Comput. Technol. 1(10), 71\u201389 (2005). (in Russian)","journal-title":"Comput. Technol."},{"key":"48_CR17","unstructured":"McColl, W.F.: General purpose parallel computing. In: Lectures on Parallel Computation. Cambridge International Series on Parallel Computation, pp. 337\u2013391. Cambridge University Press, Cambridge (1993)"},{"issue":"8","key":"48_CR18","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990)","journal-title":"Commun. ACM"},{"key":"48_CR19","unstructured":"Val\u2019kevich, N.V.: $$Q$$-effective implementation of the algorithm for matrix multiplication on a supercomputer \u201cTornado SUSU\u201d: Graduate qualification work of bachelor in direction \u201cFundamental informatics and information technology\u201d: 02.03.02. 32 s. South Ural State University, Chelyabinsk (2017). \nhttp:\/\/omega.sp.susu.ru\/publications\/bachelorthesis\/17-Valkevich.pdf"},{"key":"48_CR20","unstructured":"Tarasov, D.E.: $$Q$$-effective co-design of realization of the Gauss-Jordan method on the supercomputer \u201cTornado SUSU\u201d: Graduate qualification work of master in direction \u201cFundamental informatics and information technology\u201d: 02.04.02. 41 s. South Ural State University, Chelyabinsk (2017). \nhttp:\/\/omega.sp.susu.ru\/publications\/masterthesis\/17-Tarasov.pdf"},{"key":"48_CR21","unstructured":"Lapteva, Yu.S.: $$Q$$-effective implementation of the Jacobi method for solving SLAE on the supercomputer \u201cTornado SUSU\u201d: Graduate qualification work of bachelor in direction \u201cFundamental informatics and information technology\u201d: 02.03.02. 30 s. South Ural State University, Chelyabinsk (2017). \nhttp:\/\/omega.sp.susu.ru\/publications\/bachelorthesis\/17-Lapteva.pdf"}],"container-title":["Communications in Computer and Information Science","Supercomputing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05807-4_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T23:17:23Z","timestamp":1546211843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05807-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,31]]},"ISBN":["9783030058067","9783030058074"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05807-4_48","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018,12,31]]},"assertion":[{"value":"RuSCDays","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russian Supercomputing Days","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ruscdays2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/russianscdays.org\/en","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}