{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:55Z","timestamp":1742912455115,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030011673"},{"type":"electronic","value":"9783030011680"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-01168-0_10","type":"book-chapter","created":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T00:03:17Z","timestamp":1538092997000},"page":"102-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Creating a Schedule for Parallel Execution of Tasks Based on the Adjacency Lists"],"prefix":"10.1007","author":[{"given":"Yulia","family":"Shichkina","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Kupriyanov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,29]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"He, B., Tang, L., Xie, J., Wang, X., Song, A.: Parallel numerical simulations of three-dimensional electromagnetic radiation with MPI-CUDA paradigms. Math. Probl. Eng. 2015, 9 pages (2015). Article ID 823426","key":"10_CR1","DOI":"10.1155\/2015\/823426"},{"doi-asserted-by":"crossref","unstructured":"Qin, J., Lu, Y., Zhong, Y.: Parallel algorithm for wireless data compression and encryption. J. Sensors 2017, 11 pages (2017). Article ID 4209397","key":"10_CR2","DOI":"10.1155\/2017\/4209397"},{"doi-asserted-by":"crossref","unstructured":"Gong, C., Bao, W., Tang, G., Jiang, Y., Liu, J.: A parallel algorithm for the two-dimensional time fractional diffusion equation with implicit difference method. Sci. World J. 2014, 8 pages (2014). Article ID 219580","key":"10_CR3","DOI":"10.1155\/2014\/219580"},{"doi-asserted-by":"crossref","unstructured":"Ma, X., Liu, S., Xiao, M., Xie, G.: Parallel algorithm with parameters based on alternating direction for solving banded linear systems. Math. Probl. Eng. 2014, 8 pages (2014). Article ID 752651","key":"10_CR4","DOI":"10.1155\/2014\/752651"},{"doi-asserted-by":"crossref","unstructured":"Hou, J., Lv, Q., Xiao, M.: A parallel preconditioned modified conjugate gradient method for large sylvester matrix equation. Math. Probl. Eng. 2014, 7 pages (2014). Article ID 598716","key":"10_CR5","DOI":"10.1155\/2014\/598716"},{"doi-asserted-by":"crossref","unstructured":"Yu, D.-X., Yang, Z.-S., Yu, Y., Jiang, X.-R.: Research on large-scale road network partition and route search method combined with traveler preferences. Math. Probl. Eng. 2013, 8 pages (2013). Article ID 950876","key":"10_CR6","DOI":"10.1155\/2013\/950876"},{"doi-asserted-by":"crossref","unstructured":"Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: Processings AFIPS Spring Joint Computer Conference, Reston, pp. 483\u2013485. AFIPS Press, VA (1967)","key":"10_CR7","DOI":"10.1145\/1465482.1465560"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1109\/MSPEC.1972.5218755","volume":"9","author":"Willis H. Ware","year":"1972","unstructured":"Ware, W.: The ultimate computer. IEEE Spectrum 9, 84\u201391 (1972)","journal-title":"IEEE Spectrum"},{"unstructured":"Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, Second Edition. Addison Wesley, Reading (2003)","key":"10_CR9"},{"key":"10_CR10","volume-title":"Parallel Computing for Multiprocessor Computers","author":"VP Gergel","year":"2003","unstructured":"Gergel, V.P., Strongin, R.G.: Parallel Computing for Multiprocessor Computers. NGU Publ, Nizhnij Novgorod (2003). (in Russian)"},{"key":"10_CR11","volume-title":"Parallel Programming in C with MPI and OpenMP","author":"MJ Quinn","year":"2003","unstructured":"Quinn, M.J.: Parallel Programming in C with MPI and OpenMP, 1st edn. McGraw-Hill Education, New York (2003)","edition":"1"},{"unstructured":"Wittwer, T.: An Introduction to Parallel Programming, VSSD uitgeverij (2006)","key":"10_CR12"},{"issue":"8\u20139","key":"10_CR13","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.parco.2009.07.001","volume":"35","author":"A Tiwari","year":"2009","unstructured":"Tiwari, A., Tabatabaee, V., Hollingsworth, J.K.: Tuning parallel applications in parallel. Parallel Comput. 35(8\u20139), 475\u2013492 (2009)","journal-title":"Parallel Comput."},{"issue":"1\u20132","key":"10_CR14","first-page":"17","volume":"21","author":"M Mubarak","year":"2013","unstructured":"Mubarak, M., Seol, S., Qiukai, L., Shephard, M.S.: A parallel ghosting algorithm for the flexible distributed mesh database. Sci. Program. 21(1\u20132), 17\u201342 (2013)","journal-title":"Sci. Program."},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/52.1991","volume":"5","author":"B Kruatrachue","year":"1988","unstructured":"Kruatrachue, B., Lewis, T.: Grain size determination for parallel processing. IEEE Softw. 5(1), 23\u201332 (1988)","journal-title":"IEEE Softw."},{"issue":"3\u20134","key":"10_CR16","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0167-8191(98)00021-0","volume":"24","author":"AW Lim","year":"1998","unstructured":"Lim, A.W., Lam, M.S.: Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Comput. 24(3\u20134), 445\u2013475 (1998)","journal-title":"Parallel Comput."},{"unstructured":"Meuer, H., Strohmaier, E., Dongarra, J., Simon, H.: Top500 supercomputing sites (2015)","key":"10_CR17"},{"issue":"9","key":"10_CR18","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/71.308533","volume":"5","author":"T Yang","year":"1994","unstructured":"Yang, T., Gerasoulis, A.: DSC: scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel Distrib. Syst. 5(9), 951\u2013967 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/71.655248","volume":"9","author":"S Darbha","year":"1998","unstructured":"Darbha, S., Agrawal, D.P.: Optimal scheduling algorithm for distributed memory machines. IEEE Trans. Parallel Distrib. Syst. 9(1), 87\u201395 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in hard real-time environment. J. ACM 20(1), 46\u201361 (1973)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR21","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1145\/322326.322337","volume":"29","author":"B Marte","year":"1982","unstructured":"Marte, B.: Preemptive scheduling with release times, deadlines and due times. J. ACM 29(3), 812\u2013829 (1982)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR22","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1049\/sej.1991.0015","volume":"6","author":"A. Burns","year":"1991","unstructured":"Burns, A.: Scheduling hard real-time systems: a review. Softw. Eng. J. 6(3), 116\u2013128 (1991)","journal-title":"Software Engineering Journal"},{"doi-asserted-by":"crossref","unstructured":"Stankovic, J.A.: Implications of classical scheduling results for real-time systems. IEEE Computer Society Press (1995)","key":"10_CR23","DOI":"10.1109\/2.386982"},{"issue":"1","key":"10_CR24","first-page":"15","volume":"46","author":"S Darbha","year":"1997","unstructured":"Darbha, S., Agrawal, D.P.: A task duplication based scalable scheduling algorithm for distributed memory systems. IEEE Trans. Parallel Distrib. Syst. 46(1), 15\u201327 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/71.205655","volume":"4","author":"T.H. Tzen","year":"1993","unstructured":"Tzen, T.H., Ni, L.M.: Trapezoid self-scheduling: a practical scheduling scheme for parallel compilers. IEEE Trans. Parallel Distrib. Syst. 4, 87\u201398 (1993)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"6","key":"10_CR26","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TPDS.2005.64","volume":"16","author":"O. Sinnen","year":"2005","unstructured":"Sinnen, O., Sousa, L.A.: Communication contention in task scheduling. IEEE Trans. Parallel Distrib. Syst. 16, 503\u2013515 (2005)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"9","key":"10_CR27","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPDS.2004.38","volume":"15","author":"AS Wu","year":"2004","unstructured":"Wu, A.S., Yu, H., Jin, S., Lin, K.-C., Schiavone, G.: An incremental genetic algorithm approach to multiprocessor scheduling. IEEE Trans. Parallel Distrib. Syst. 15(9), 824\u2013834 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"publisher","unstructured":"Kupriyanov, M.S., Shichkina, Y.A.: Applying the list method to the transformation of parallel algorithms into account temporal characteristics of operations. In: Proceedings of the 19th International Conference on Soft Computing and Measurements, SCM 2016, pp. 292\u2013295. https:\/\/doi.org\/10.1109\/scm.2016.7519759 , ISBN 978-146738919-8. 7519759","key":"10_CR28","DOI":"10.1109\/scm.2016.7519759"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-46301-8_5","volume-title":"Internet of Things, Smart Spaces, and Next Generation Networks and Systems","author":"Y Shichkina","year":"2016","unstructured":"Shichkina, Y., Kupriyanov, M., Al-Mardi, M.: Optimization algorithm for an information graph for an amount of communications. In: Galinina, O., Balandin, S., Koucheryavy, Y. (eds.) NEW2AN\/ruSMART -2016. LNCS, vol. 9870, pp. 50\u201362. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46301-8_5"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-319-42108-7_28","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2016","author":"Y Shichkina","year":"2016","unstructured":"Shichkina, Y., Degtyarev, A., Gushchanskiy, D., Iakushkin, O.: Application of optimization of parallel algorithms to queries in relational databases. In: Gervasi, O., et al. (eds.) ICCSA 2016. LNCS, vol. 9787, pp. 366\u2013378. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42108-7_28"}],"container-title":["Lecture Notes in Computer Science","Internet of Things, Smart Spaces, and Next Generation Networks and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01168-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T20:58:39Z","timestamp":1571950719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01168-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030011673","9783030011680"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01168-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ruSMART","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Internet of Things and Smart Spaces","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","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":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rusmart2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rusmart.e-werest.org\/2018.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"186","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"64","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}