{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T11:45:18Z","timestamp":1750419918587},"publisher-location":"Cham","reference-count":28,"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_19","type":"book-chapter","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:03:53Z","timestamp":1584576233000},"page":"211-223","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving Locality-Aware Scheduling with Acyclic Directed Graph Partitioning"],"prefix":"10.1007","author":[{"given":"M. Yusuf","family":"\u00d6zkaya","sequence":"first","affiliation":[]},{"given":"Anne","family":"Benoit","sequence":"additional","affiliation":[]},{"given":"\u00dcmit V.","family":"\u00c7ataly\u00fcrek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"C237","DOI":"10.1137\/100813956","volume":"35","author":"K Akbudak","year":"2013","unstructured":"Akbudak, K., Kayaaslan, E., Aykanat, C.: Hypergraph partitioning based models and methods for exploiting cache locality in sparse matrix-vector multiplication. SIAM J. Sci. Comput. 35(3), C237\u2013C262 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Aktulga, H.M., Bulu\u00e7, A., Williams, S., Yang, C.: Optimizing sparse matrix-multiple vectors multiplication for nuclear configuration interaction calculations. In 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pp. 1213\u20131222, May 2014","DOI":"10.1109\/IPDPS.2014.125"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"LA Belady","year":"1966","unstructured":"Belady, L.A.: A study of replacement algorithms for a virtual-storage computer. IBM Syst. J. 5(2), 78\u2013101 (1966)","journal-title":"IBM Syst. J."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"e190","DOI":"10.7717\/peerj-cs.190","volume":"5","author":"B Bramas","year":"2019","unstructured":"Bramas, B.: Impact study of data locality on task-based applications through the Heteroprio scheduler. PeerJ. Comput. Sci. 5, e190 (2019)","journal-title":"PeerJ. Comput. Sci."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Chen, D., Liu, F., Ding, C., Pai, S.: Locality analysis through static parallel sampling. In: Proceedings of the 39th ACM SIGPLAN Conference on PLDI, pp. 557\u2013570. ACM, New York (2018)","DOI":"10.1145\/3296979.3192402"},{"issue":"1","key":"19_CR6","first-page":"1:1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1\u20131:25 (2011)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"53:1","DOI":"10.1145\/2541228.2555309","volume":"10","author":"N Fauzia","year":"2013","unstructured":"Fauzia, N., et al.: Beyond reuse distance analysis: dynamic analysis for characterization of data locality potential. ACM Trans. Archit. Code Optim. 10(4), 53:1\u201353:29 (2013)","journal-title":"ACM Trans. Archit. Code Optim."},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"30:1","DOI":"10.1145\/3017994","volume":"43","author":"S Filippone","year":"2017","unstructured":"Filippone, S., Cardellini, V., Barbieri, D., Fanfarillo, A.: Sparse matrix-vector multiplication on GPGPUs. ACM Trans. Math. Softw. 43(4), 30:1\u201330:49 (2017)","journal-title":"ACM Trans. Math. Softw."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Fuller, S.H., Millett, L.I.: The Future of Computing Performance: Game Over or Next Level? National Academy Press, Washington DC (2011)","DOI":"10.1109\/MC.2011.15"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Gustedt, J., Jeannot, E., Mansouri, F.: Optimizing locality by topology-aware placement for a task based programming model. In: 2016 IEEE International Conference on Cluster Computing (CLUSTER), pp. 164\u2013165, September 2016","DOI":"10.1109\/CLUSTER.2016.87"},{"issue":"4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"A2117","DOI":"10.1137\/18M1176865","volume":"41","author":"J Herrmann","year":"2019","unstructured":"Herrmann, J., \u00d6zkaya, M.Y., U\u00e7ar, B., Kaya, K., \u00c7ataly\u00fcrek, \u00dc.V.: Multilevel algorithms for acyclic partitioning of directed acyclic graphs. SIAM J. Sci. Comput. (SISC) 41(4), A2117\u2013A2145 (2019)","journal-title":"SIAM J. Sci. Comput. (SISC)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Hollman, D.S., Bennett, J.C., Kolla, H., Lifflander, J., Slattengren, N., Wilke, J.: Metaprogramming-enabled parallel execution of apparently sequential C++ code. In: 2016 Second International Workshop on Extreme Scale Programming Models and Middleware (ESPM2), pp. 24\u201331, November 2016","DOI":"10.1109\/ESPM2.2016.009"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Hong, C., Sukumaran-Rajam, A., Nisa, I., Singh, K., Sadayappan, P.: Adaptive sparse tiling for sparse matrix multiplication. In: Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, pp. 300\u2013314. ACM, New York (2019)","DOI":"10.1145\/3293883.3295712"},{"key":"19_CR15","unstructured":"Hu, X., Wang, X., Zhou, L., Luo, Y., Ding, C., Wang, Z.: Kinetic modeling of data eviction in cache. In: 2016 USENIX Annual Technical Conference (USENIX ATC 2016), Denver, CO, pp. 351\u2013364. USENIX Association (2016)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Jacquelin, M., Marchal, L., Robert, Y., U\u00e7ar, B.: On optimal tree traversals for sparse matrix factorization. In: IPDPS 2011, pp. 556\u2013567 (2011)","DOI":"10.1109\/IPDPS.2011.60"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1016\/j.future.2018.04.086","volume":"93","author":"J Jin","year":"2019","unstructured":"Jin, J., et al.: A data-locality-aware task scheduler for distributed social graph queries. Futur. Gener. Comput. Syst. 93, 1010\u20131022 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.simpat.2018.12.003","volume":"91","author":"M Kiani","year":"2019","unstructured":"Kiani, M., Rajabzadeh, A.: Analyzing data locality in GPU kernels using memory footprint analysis. Simul. Model. Pract. Theory 91, 102\u2013122 (2019)","journal-title":"Simul. Model. Pract. Theory"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Mayer, R., Mayer, C., Laich, L.: The tensorflow partitioning and scheduling problem: it\u2019s the critical path! In: Proceedings of the 1st Workshop on Distributed Infrastructures for Deep Learning, DIDL 2017, pp. 1\u20136. ACM, New York (2017)","DOI":"10.1145\/3154842.3154843"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.future.2018.07.043","volume":"90","author":"NS Naik","year":"2019","unstructured":"Naik, N.S., Negi, A., Tapas Bapu, B.R., Anitha, R.: A data locality based scheduler to enhance MapReduce performance in heterogeneous environments. Future Gener. Comput. Syst. 90, 423\u2013434 (2019)","journal-title":"Future Gener. Comput. Syst."},{"key":"19_CR21","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing System, pp. 849\u2013856 (2002)"},{"key":"19_CR22","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Rogers, S., Tabkhi, H.: Locality aware memory assignment and tiling. In: 2018 55th ACM\/ESDA\/IEEE Design Automation Conference (DAC), June 2018","DOI":"10.1109\/DAC.2018.8465904"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Sethi, R.: Complete register allocation problems. In: Proceedings of the 5th Annual ACM Symposium on Theory of Computing (STOC 1973), pp. 182\u2013195 (1973)","DOI":"10.1145\/800125.804049"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-19328-6_1","volume-title":"High Performance Computing for Computational Science \u2013 VECPAR 2010","author":"J Shalf","year":"2011","unstructured":"Shalf, J., Dosanjh, S., Morrison, J.: Exascale computing technology challenges. In: Palma, J.M.L.M., Dayd\u00e9, M., Marques, O., Lopes, J.C. (eds.) VECPAR 2010. LNCS, vol. 6449, pp. 1\u201325. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-19328-6_1"},{"issue":"1\u20133","key":"19_CR26","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0169-7439(87)80084-9","volume":"2","author":"S Wold","year":"1987","unstructured":"Wold, S., Esbensen, K., Geladi, P.: Principal component analysis. Chemometr. Intell. Lab. Syst. 2(1\u20133), 37\u201352 (1987)","journal-title":"Chemometr. Intell. Lab. Syst."},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Xie, B., et al.: CVR: Efficient vectorization of SpMV on x86 processors. In: Proceedings of the 2018 International Symposium on Code Generation and Optimization, CGO 2018, pp. 149\u2013162. ACM (2018)","DOI":"10.1145\/3179541.3168818"},{"issue":"12","key":"19_CR28","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.parco.2011.08.004","volume":"37","author":"AN Yzelman","year":"2011","unstructured":"Yzelman, A.N., Bisseling, R.H.: Two-dimensional cache-oblivious sparse matrix-vector multiplication. Parallel Comput. 37(12), 806\u2013819 (2011)","journal-title":"Parallel 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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:08:44Z","timestamp":1584576524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43229-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030432287","9783030432294"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43229-4_19","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)"}}]}}