{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T19:03:15Z","timestamp":1772823795686,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819708000","type":"print"},{"value":"9789819708017","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0801-7_21","type":"book-chapter","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T08:03:04Z","timestamp":1709193784000},"page":"360-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Heuristic Method for\u00a0Data Allocation and\u00a0Task Scheduling on\u00a0Heterogeneous Multiprocessor Systems Under Memory Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0618-4969","authenticated-orcid":false,"given":"Junwen","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7381-5462","authenticated-orcid":false,"given":"Liangcai","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6190-7630","authenticated-orcid":false,"given":"Siyuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1827-6297","authenticated-orcid":false,"given":"Chen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4975-8280","authenticated-orcid":false,"given":"Ronghua","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4794-9833","authenticated-orcid":false,"given":"Zhouxing","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9185-3233","authenticated-orcid":false,"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/130938505","volume":"38","author":"E Agullo","year":"2016","unstructured":"Agullo, E., Amestoy, P.R., Buttari, A., Guermouche, A., Excellent, J.Y., Rouet, F.H.: Robust memory-aware mappings for parallel multifrontal factorizations. SIAM J. Sci. Comput. 38(3), 256\u2013279 (2016)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TPDS.2013.57","volume":"25","author":"H Arabnejad","year":"2014","unstructured":"Arabnejad, H., Barbosa, J.G.: List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans. Parallel Distrib. Syst. 25(3), 682\u2013694 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Aupy, G., Brasseur, C., Marchal, L.: Dynamic memory-aware task-tree scheduling. In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 758\u2013767 (2017)","DOI":"10.1109\/IPDPS.2017.58"},{"issue":"7","key":"21_CR4","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1109\/TC.2006.113","volume":"55","author":"S Baruah","year":"2006","unstructured":"Baruah, S., Fisher, N.: The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Trans. Comput. 55(7), 918\u2013923 (2006)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1007\/s11590-013-0669-7","volume":"8","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Feofiloff, P., Fernandes, C.G., De Melo, E.L., Oshiro, M.T., Ronconi, D.P.: A MILP model for an extended version of the flexible job shop problem. Optimization Lett. 8(4), 1417\u20131431 (2014)","journal-title":"Optimization Lett."},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369\u2013375 (1990)","journal-title":"Computing"},{"issue":"10","key":"21_CR7","doi-asserted-by":"publisher","first-page":"1884","DOI":"10.1109\/TVLSI.2010.2058873","volume":"19","author":"T Chantem","year":"2010","unstructured":"Chantem, T., Hu, X.S., Dick, R.P.: Temperature-aware scheduling and assignment for hard real-time applications on mpsocs. IEEE Trans. Very Large Scale Integration Syst. 19(10), 1884\u20131897 (2010)","journal-title":"IEEE Trans. Very Large Scale Integration Syst."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/TPDS.2012.114","volume":"24","author":"YS Chen","year":"2012","unstructured":"Chen, Y.S., Liao, H.C., Tsai, T.H.: Online real-time task scheduling in heterogeneous multicore system-on-a-chip. IEEE Trans. Parallel Distrib. Syst. 24(1), 118\u2013130 (2012)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Dick, R.P., Rhodes, D.L., Wolf, W.: Tgff: task graphs for free. In: Proceedings of the Sixth International Workshop on Hardware\/Software Codesign, pp. 97\u2013101. IEEE (1998)","DOI":"10.1145\/278241.278309"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Ding, J., L\u00fc, Z., Li, C.M., Shen, L., Xu, L., Glover, F.: A two-individual based evolutionary algorithm for the flexible job shop scheduling problem. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 2262\u20132271 (2019)","DOI":"10.1609\/aaai.v33i01.33012262"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s11265-012-0703-5","volume":"71","author":"J Du","year":"2013","unstructured":"Du, J., Wang, Y., Zhuge, Q., Hu, J., Sha, E.H.M.: Efficient loop scheduling for chip multiprocessors with non-volatile main memory. J. Signal Process. Syst. 71(3), 261\u2013273 (2013)","journal-title":"J. Signal Process. Syst."},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/s11227-011-0625-1","volume":"64","author":"D Ergu","year":"2013","unstructured":"Ergu, D., Kou, G., Peng, Y., Shi, Y., Shi, Y.: The analytic hierarchy process: task scheduling and resource allocation in cloud computing environment. J. Supercomput. 64(3), 835\u2013848 (2013)","journal-title":"J. Supercomput."},{"issue":"10","key":"21_CR13","doi-asserted-by":"publisher","first-page":"2406","DOI":"10.1109\/TPDS.2020.2992073","volume":"31","author":"Z Fu","year":"2020","unstructured":"Fu, Z., Tang, Z., Yang, L., Liu, C.: An optimal locality-aware task scheduling algorithm based on bipartite graph modelling for spark applications. IEEE Trans. Parallel Distrib. Syst. 31(10), 2406\u20132420 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2015.02.052","volume":"245","author":"MA Gonz\u00e1lez","year":"2015","unstructured":"Gonz\u00e1lez, M.A., Vela, C.R., Varela, R.: Scatter search with path relinking for the flexible job shop scheduling problem. Eur. J. Oper. Res. 245(1), 35\u201345 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00186-013-0456-3","volume":"79","author":"RS Hansmann","year":"2014","unstructured":"Hansmann, R.S., Rieger, T., Zimmermann, U.T.: Flexible job shop scheduling with blockages. Math. Methods Oper. Res. 79(2), 135\u2013161 (2014)","journal-title":"Math. Methods Oper. Res."},{"issue":"10","key":"21_CR16","doi-asserted-by":"publisher","first-page":"5681","DOI":"10.1007\/s00521-019-04415-2","volume":"32","author":"Y Hu","year":"2020","unstructured":"Hu, Y., Li, J., He, L.: A reformed task scheduling algorithm for heterogeneous distributed systems with energy consumption constraints. Neural Comput. Appl. 32(10), 5681\u20135693 (2020)","journal-title":"Neural Comput. Appl."},{"issue":"2","key":"21_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.3844\/jcssp.2007.94.103","volume":"3","author":"E Ilavarasan","year":"2007","unstructured":"Ilavarasan, E., Thambidurai, P.: Low complexity performance effective task scheduling algorithm for heterogeneous computing environments. J. Comput. Sci. 3(2), 94\u2013103 (2007)","journal-title":"J. Comput. Sci."},{"issue":"6","key":"21_CR18","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.jss.2011.01.051","volume":"84","author":"Q Kang","year":"2011","unstructured":"Kang, Q., He, H., Song, H.: Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm. J. Syst. Softw. 84(6), 985\u2013992 (2011)","journal-title":"J. Syst. Softw."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Kang, S., Dean, A.G.: Darts: techniques and tools for predictably fast memory using integrated data allocation and real-time task scheduling. In: The 16th IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 333\u2013342. IEEE (2010)","DOI":"10.1109\/RTAS.2010.36"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Liu, J.: An application of generalized tree pebbling to sparse matrix factorization. SIAM J. Algebraic Discrete Methods (1987)","DOI":"10.1137\/0608031"},{"issue":"1","key":"21_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M Mastrolilli","year":"2000","unstructured":"Mastrolilli, M., Gambardella, L.M.: Effective neighbourhood functions for the flexible job shop problem. J. Sched. 3(1), 3\u201320 (2000)","journal-title":"J. Sched."},{"issue":"1","key":"21_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1504\/IJCAET.2011.037869","volume":"3","author":"B Ouni","year":"2011","unstructured":"Ouni, B., Ayadi, R., Mtibaa, A.: Partitioning and scheduling technique for run time reconfigured systems. Intern. J. Comput. Aided Eng. Technol. 3(1), 77\u201391 (2011)","journal-title":"Intern. J. Comput. Aided Eng. Technol."},{"issue":"6","key":"21_CR23","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1016\/j.apm.2009.09.002","volume":"34","author":"C \u00d6zg\u00fcven","year":"2010","unstructured":"\u00d6zg\u00fcven, C., \u00d6zbak\u0131r, L., Yavuz, Y.: Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl. Math. Model. 34(6), 1539\u20131548 (2010)","journal-title":"Appl. Math. Model."},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10723-016-9374-y","volume":"15","author":"AD Peris","year":"2017","unstructured":"Peris, A.D., Hern\u00e1ndez, J., Huedo, E.: Distributed late-binding scheduling and cooperative data caching. J. Grid Comput. 15, 235\u2013256 (2017)","journal-title":"J. Grid Comput."},{"issue":"3","key":"21_CR25","doi-asserted-by":"publisher","first-page":"4147","DOI":"10.1007\/s12652-020-01794-6","volume":"12","author":"J Praveenchandar","year":"2021","unstructured":"Praveenchandar, J., Tamilarasi, A.: Dynamic resource allocation with optimized task scheduling and improved power management in cloud computing. J. Ambient. Intell. Humaniz. Comput. 12(3), 4147\u20134159 (2021)","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, A., et al.: Scheduling data-intensiveworkflows onto storage-constrained distributed resources. In: Seventh IEEE International Symposium on Cluster Computing and the Grid, vol. 1, pp. 401\u2013409 (2007)","DOI":"10.1109\/CCGRID.2007.101"},{"issue":"20","key":"21_CR27","doi-asserted-by":"publisher","first-page":"6247","DOI":"10.1080\/00207543.2013.827806","volume":"51","author":"V Roshanaei","year":"2013","unstructured":"Roshanaei, V., Azab, A., ElMaraghy, H.: Mathematical modelling and a meta-heuristic for flexible job shop scheduling. Int. J. Prod. Res. 51(20), 6247\u20136274 (2013)","journal-title":"Int. J. Prod. Res."},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Sb\u00eerlea, D., Budimli\u0107, Z., Sarkar, V.: Bounded memory scheduling of dynamic task graphs. In: Proceedings of the 23rd International Conference on Parallel Architectures and Compilation, pp. 343\u2013356 (2014)","DOI":"10.1145\/2628071.2628090"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Sergent, M., Goudin, D., Thibault, S., Aumage, O.: Controlling the memory subscription of distributed applications with a task-based runtime system. In: 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 318\u2013327 (2016)","DOI":"10.1109\/IPDPSW.2016.105"},{"issue":"4","key":"21_CR30","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1145\/321607.321620","volume":"17","author":"R Sethi","year":"1970","unstructured":"Sethi, R., Ullman, J.D.: The generation of optimal code for arithmetic expressions. J. ACM 17(4), 715\u2013728 (1970)","journal-title":"J. ACM"},{"issue":"6","key":"21_CR31","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/TPDS.2005.71","volume":"16","author":"Z Shao","year":"2005","unstructured":"Shao, Z., Zhuge, Q., Xue, C., Sha, E.M.: Efficient assignment and scheduling for heterogeneous dsp systems. IEEE Trans. Parallel Distrib. Syst. 16(6), 516\u2013525 (2005)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"21_CR32","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260\u2013274 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"21_CR33","first-page":"1","volume":"2016","author":"G Wang","year":"2016","unstructured":"Wang, G., Wang, Y., Liu, H., Guo, H.: Hsip: a novel task scheduling algorithm for heterogeneous computing. Sci. Program. 2016(2), 1\u201311 (2016)","journal-title":"Sci. Program."},{"issue":"2","key":"21_CR34","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/TETC.2014.2300632","volume":"2","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Li, K., Chen, H., He, L., Li, K.: Energy-aware data allocation and task scheduling on heterogeneous multiprocessor systems with time constraints. IEEE Trans. Emerg. Top. Comput. 2(2), 134\u2013148 (2014)","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"issue":"3","key":"21_CR35","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1109\/TWC.2019.2901684","volume":"18","author":"W Xia","year":"2019","unstructured":"Xia, W., Quek, T.Q., Zhang, J., Jin, S., Zhu, H.: Programmable hierarchical c-ran: from task scheduling to resource allocation. IEEE Trans. Wireless Commun. 18(3), 2003\u20132016 (2019)","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"10","key":"21_CR36","doi-asserted-by":"publisher","first-page":"4712","DOI":"10.1109\/TII.2018.2851241","volume":"14","author":"L Yin","year":"2018","unstructured":"Yin, L., Luo, J., Luo, H.: Tasks scheduling and resource allocation in fog computing based on containers for smart manufacturing. IEEE Trans. Industr. Inf. 14(10), 4712\u20134721 (2018)","journal-title":"IEEE Trans. Industr. Inf."},{"issue":"2","key":"21_CR37","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/TASE.2018.2857206","volume":"16","author":"H Yuan","year":"2018","unstructured":"Yuan, H., Bi, J., Zhou, M.: Spatial task scheduling for cost minimization in distributed green cloud data centers. IEEE Trans. Autom. Sci. Eng. 16(2), 729\u2013740 (2018)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"6","key":"21_CR38","doi-asserted-by":"publisher","first-page":"3253","DOI":"10.1109\/TSP.2012.2189768","volume":"60","author":"Q Zhuge","year":"2012","unstructured":"Zhuge, Q., Guo, Y., Hu, J., Tseng, W.C., Xue, C.J., Sha, E.H.M.: Minimizing access cost for multiple types of memory units in embedded systems through data allocation and scheduling. IEEE Trans. Signal Process. 60(6), 3253\u20133263 (2012)","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0801-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T08:13:44Z","timestamp":1709194424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0801-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708000","9789819708017"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0801-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tjutanklab.com\/ica3pp2023\/","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 (provided by the conference organizers)"}},{"value":"Online submission system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"439","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - 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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}