{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:38Z","timestamp":1740099638785,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030432287"},{"type":"electronic","value":"9783030432294"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-43229-4_20","type":"book-chapter","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:03:53Z","timestamp":1584576233000},"page":"224-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Isoefficiency Maps for Divisible Computations in Hierarchical Memory Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9314-529X","authenticated-orcid":false,"given":"Maciej","family":"Drozdowski","sequence":"first","affiliation":[]},{"given":"Gaurav","family":"Singh","sequence":"additional","affiliation":[]},{"given":"J\u0119drzej M.","family":"Marsza\u0142kowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1109\/12.9739","volume":"37","author":"R Agrawal","year":"1988","unstructured":"Agrawal, R., Jagadish, H.V.: Partitioning techniques for large-grained parallelism. IEEE Trans. Comput. 37, 1627\u20131634 (1988)","journal-title":"IEEE Trans. Comput."},{"key":"20_CR2","volume-title":"The Design and Analysis of Parallel Algorithms","author":"SG Akl","year":"1989","unstructured":"Akl, S.G.: The Design and Analysis of Parallel Algorithms. Prentice-Hall Int. Inc., Englewood Cliffs (1989)"},{"key":"20_CR3","first-page":"530","volume":"235","author":"J Berli\u0144ska","year":"2014","unstructured":"Berli\u0144ska, J.: Communication scheduling in data gathering networks with limited memory. Appl. Math. Comput. 235, 530\u2013537 (2014)","journal-title":"Appl. Math. Comput."},{"key":"20_CR4","volume-title":"Scheduling Divisible Loads in Parallel and Distributed Systems","author":"V Bharadwaj","year":"1996","unstructured":"Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"20_CR5","series-title":"Computer Communications and Networks","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-310-5","volume-title":"Scheduling for Parallel Processing","author":"M Drozdowski","year":"2009","unstructured":"Drozdowski, M.: Scheduling for Parallel Processing. CCN. Springer, London (2009). \nhttps:\/\/doi.org\/10.1007\/978-1-84882-310-5"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-32152-3_11","volume-title":"Parallel Processing and Applied Mathematics","author":"M Drozdowski","year":"2016","unstructured":"Drozdowski, M., Marsza\u0142kowski, J.M.: Divisible loads scheduling in hierarchical memory systems with time and energy constraints. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K., Kitowski, J., Wiatr, K. (eds.) PPAM 2015. LNCS, vol. 9574, pp. 111\u2013120. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-32152-3_11"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.future.2013.07.004","volume":"36","author":"M Drozdowski","year":"2014","unstructured":"Drozdowski, M., Marsza\u0142kowski, J.M., Marsza\u0142kowski, J.: Energy trade-offs analysis using equal-energy maps. Future Gener. Comput. Syst. 36, 311\u2013321 (2014)","journal-title":"Future Gener. Comput. Syst."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1109\/TPDS.2009.128","volume":"21","author":"M Drozdowski","year":"2010","unstructured":"Drozdowski, M., Wielebski, \u0141.: Isoefficiency maps for divisible computations. IEEE Trans. Parallel Distrib. Syst. 21, 872\u2013880 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPDS.2003.1239872","volume":"14","author":"M Drozdowski","year":"2003","unstructured":"Drozdowski, M., Wolniewicz, P.: Out-of-core divisible load processing. IEEE Trans. Parallel Distrib. Syst. 14, 1048\u20131056 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Ghanbari, S., Othman, M.: Comprehensive review on divisible load theory: concepts, strategies, and approaches. Math. Prob. Eng. (2014). \nhttp:\/\/dx.doi.org\/10.1155\/2014\/460354\n\n. Article ID 460354, 13 Pages","DOI":"10.1155\/2014\/460354"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1109\/TPDS.2005.117","volume":"16","author":"D Ghose","year":"2005","unstructured":"Ghose, D., Kim, H.J., Kim, T.H.: Adaptive divisible load scheduling strategies for workstation clusters with unknown network resources. IEEE Trans. Parallel Distrib. Syst. 16, 897\u2013907 (2005)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/jpdc.1993.1107","volume":"19","author":"A Gupta","year":"1993","unstructured":"Gupta, A., Kumar, V.: Performance properties of large scale parallel systems. J. Parallel Distrib. Comput. 19, 234\u2013244 (1993)","journal-title":"J. Parallel Distrib. Comput."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1109\/7.826329","volume":"36","author":"X Li","year":"2000","unstructured":"Li, X., Bharadwaj, V., Ko, C.C.: Divisible load scheduling on single-level tree networks with buffer constraints. IEEE Trans. Aerosp. Electron. Syst. 36, 1298\u20131308 (2000)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10723-015-9345-8","volume":"14","author":"JM Marsza\u0142kowski","year":"2016","unstructured":"Marsza\u0142kowski, J.M., Drozdowski, M., Marsza\u0142kowski, J.: Time and energy performance of parallel systems with hierarchical memory. J. Grid Comput. 14, 153\u2013170 (2016)","journal-title":"J. Grid Comput."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/MC.2003.1198238","volume":"36","author":"T Robertazzi","year":"2003","unstructured":"Robertazzi, T.: Ten reasons to use divisible load theory. IEEE Comput. 36, 63\u201368 (2003)","journal-title":"IEEE Comput."},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MC.2013.222","volume":"46","author":"S Swanson","year":"2013","unstructured":"Swanson, S., Caulfield, A.M.: Refactor, reduce, recycle: restructuring the I\/O stack for the future of storage. IEEE Comput. 46, 52\u201359 (2013)","journal-title":"IEEE Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43229-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:08:34Z","timestamp":1584576514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43229-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030432287","9783030432294"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43229-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ppam.pl\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","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":"91","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":"57% - 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":"2,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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}