{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T21:59:31Z","timestamp":1764194371714},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030206550"},{"type":"electronic","value":"9783030206567"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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-20656-7_16","type":"book-chapter","created":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T23:02:40Z","timestamp":1559689360000},"page":"312-329","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Global Task Data-Dependencies in PGAS Applications"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Schuchart","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Gracia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,17]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2766064","author":"E Agullo","year":"2018","unstructured":"Agullo, E., Aumage, O., Faverge, M., Furmento, N., Pruvost, F., Sergent, M., Thibault, S.P.: Achieving high performance on supercomputers with a sequential task-based programming model. IEEE Trans. Parallel Distrib. Syst. (2018). https:\/\/doi.org\/10.1109\/TPDS.2017.2766064","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"16_CR2","unstructured":"Amarasinghe, S., et al.: Exascale software study: software challenges in extreme scale systems. Technical report, DARPA IPTO, Air Force Research Labs (2009)"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Bauer, M., Treichler, S., Slaughter, E., Aiken, A.: Legion: expressing locality and independence with logical regions. In: 2012 International Conference for High Performance Computing, Networking, Storage and Analysis (SC), pp. 1\u201311, November 2012. https:\/\/doi.org\/10.1109\/SC.2012.71","DOI":"10.1109\/SC.2012.71"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Belli, R., Hoefler, T.: Notified access: extending remote memory access programming models for producer-consumer synchronization. In: IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2015)","DOI":"10.1109\/IPDPS.2015.30"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Bosilca, G., Bouteiller, A., Danalis, A., Herault, T., Lemariner, P., Dongarra, J.: Dague: a generic distributed DAG engine for high performance computing, pp. 1151\u20131158. IEEE, Anchorage (2011)","DOI":"10.1109\/IPDPS.2011.281"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1177\/1094342007078442","volume":"21","author":"BL Chamberlain","year":"2007","unstructured":"Chamberlain, B.L., Callahan, D., Zima, H.P.: Parallel programmability and the Chapel language. Int. J. High Perform. Comput. Appl. 21, 291\u2013312 (2007)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.7551\/mitpress\/9486.003.0014","volume-title":"Programming Models for Parallel Computing","author":"BM Chapman","year":"2015","unstructured":"Chapman, B.M., Eachempati, D., Chandrasekaran, S.: OpenMP. In: Balaji, P. (ed.) Programming Models for Parallel Computing, pp. 281\u2013322. MIT Press, Cambridge (2015)"},{"issue":"10","key":"16_CR8","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/1103845.1094852","volume":"40","author":"Philippe Charles","year":"2005","unstructured":"Charles, P., et al.: X10: an object-oriented approach to non-uniform cluster computing. In: ACM Sigplan Notices (2005)","journal-title":"ACM SIGPLAN Notices"},{"key":"16_CR9","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626411000151","author":"A Duran","year":"2011","unstructured":"Duran, A., et al.: OmpSs: a proposal for programming heterogeneous multi-core architectures. Parallel Process. Lett. (2011). https:\/\/doi.org\/10.1142\/S0129626411000151","journal-title":"Parallel Process. Lett."},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-319-14313-2_46","volume-title":"Euro-Par 2014: Parallel Processing Workshops","author":"K F\u00fcrlinger","year":"2014","unstructured":"F\u00fcrlinger, K., et al.: DASH: data structures and algorithms with support for hierarchical locality. In: Lopes, L., et al. (eds.) Euro-Par 2014. LNCS, vol. 8806, pp. 542\u2013552. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14313-2_46"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"G\u00f3mez-Iglesias, A., Pekurovsky, D., Hamidouche, K., Zhang, J., Vienne, J.: Porting scientific libraries to PGAS in XSEDE resources: practice and experience. In: Proceedings of the 2015 XSEDE Conference: Scientific Advancements Enabled by Enhanced Cyberinfrastructure, XSEDE 2015. ACM (2015)","DOI":"10.1145\/2792745.2792785"},{"key":"16_CR12","unstructured":"Grossman, M., Kumar, V., Budimlic, Z., Sarkar, V.: Integrating asynchronous task parallelism with OpenSHMEM (2016). https:\/\/www.cs.rice.edu\/~zoran\/Publications_files\/asyncshmem2016.pdf"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Hoque, R., Herault, T., Bosilca, G., Dongarra, J.: Dynamic task discovery in parsec: a data-flow task-based runtime. In: Proceedings of the 8th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems, ScalA 2017. ACM (2017). https:\/\/doi.org\/10.1145\/3148226.3148233","DOI":"10.1145\/3148226.3148233"},{"key":"16_CR14","unstructured":"Kaiser, H., Heller, T., Adelstein-Lelbach, B., Serio, A., Fey, D.: HPX: a task based programming model in a global address space. In: PGAS 2014. ACM (2014). http:\/\/doi.acm.org\/10.1145\/2676870.2676883"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Kal\u00e9, L., Krishnan, S.: CHARM++: a portable concurrent object oriented system based on C++. In: Proceedings of OOPSLA 1993 (1993)","DOI":"10.1145\/165854.165874"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Karlin, I., Keasler, J., Neely, R.: Lulesh 2.0 updates and changes. Technical report LLNL-TR-641973 (2013)","DOI":"10.2172\/1090032"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Kumar, V., Zheng, Y., Cav\u00e9, V., Budimli\u0107, Z., Sarkar, V.: HabaneroUPC++: a compiler-free PGAS library. In: Proceedings of the 8th International Conference on Partitioned Global Address Space Programming Models, PGAS 2014. ACM (2014). https:\/\/doi.org\/10.1145\/2676870.2676879","DOI":"10.1145\/2676870.2676879"},{"issue":"2","key":"16_CR18","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/2980025.2980027","volume":"35","author":"Bill Long","year":"2016","unstructured":"Long, B.: Additional parallel features in fortran. SIGPLAN Fortran Forum, 16\u201323, July 2016. https:\/\/doi.org\/10.1145\/2980025.2980027","journal-title":"ACM SIGPLAN Fortran Forum"},{"key":"16_CR19","unstructured":"Marjanovi\u0107, V., Labarta, J., Ayguad\u00e9, E., Valero, M.: Overlapping communication and computation by using a hybrid MPI\/SMPSs approach. In: Proceedings of the 24th ACM International Conference on Supercomputing, ICS 2010. ACM (2010). http:\/\/doi.acm.org\/10.1145\/1810085.1810091"},{"key":"16_CR20","unstructured":"OpenMP Architecture Review Board: OpenMP Application Programming Interface, Version 4.5 (2015). http:\/\/www.openmp.org\/mp-documents\/openmp-4.5.pdf"},{"key":"16_CR21","volume-title":"Intel threading Building Blocks: Outfitting C++ for Multicore Processor Parallelism","author":"J Reinders","year":"2007","unstructured":"Reinders, J.: Intel threading Building Blocks: Outfitting C++ for Multicore Processor Parallelism. O\u2019Reilly & Associates, Sebastopol (2007)"},{"key":"16_CR22","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2013.21","author":"AD Robison","year":"2013","unstructured":"Robison, A.D.: Composable parallel patterns with Intel Cilk Plus. Comput. Sci. Eng. (2013). https:\/\/doi.org\/10.1109\/MCSE.2013.21","journal-title":"Comput. Sci. Eng."},{"key":"16_CR23","unstructured":"Saraswat, V., et al.: The Asynchronous Partitioned Global Address Space Model (2017)"},{"key":"16_CR24","doi-asserted-by":"publisher","unstructured":"Schuchart, J., Kowalewski, R., Fuerlinger, K.: Recent experiences in Using MPI-3 RMA in the DASH PGAS runtime. In: Proceedings of Workshops of HPC Asia, HPC Asia 2018. ACM (2018). https:\/\/doi.org\/10.1145\/3176364.3176367","DOI":"10.1145\/3176364.3176367"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-65578-9_11","volume-title":"Scaling OpenMP for Exascale Performance and Portability","author":"J Schuchart","year":"2017","unstructured":"Schuchart, J., Nachtmann, M., Gracia, J.: Patterns for OpenMP task data dependency overhead measurements. In: de Supinski, B.R., Olivier, S.L., Terboven, C., Chapman, B.M., M\u00fcller, M.S. (eds.) IWOMP 2017. LNCS, vol. 10468, pp. 156\u2013168. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-65578-9_11"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-98521-3_1","volume-title":"Evolving OpenMP for Evolving Architectures","author":"J Schuchart","year":"2018","unstructured":"Schuchart, J., Tsugane, K., Gracia, J., Sato, M.: The impact of taskyield on the design of tasks communicating through MPI. In: de Supinski, B.R., Valero-Lara, P., Martorell, X., Mateo Bellido, S., Labarta, J. (eds.) IWOMP 2018. LNCS, vol. 11128, pp. 3\u201317. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98521-3_1"},{"issue":"8","key":"16_CR27","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/3155284.3018770","volume":"52","author":"Sergei Shudler","year":"2017","unstructured":"Shudler, S., Calotoiu, A., Hoefler, T., Wolf, F.: Isoefficiency in practice: configuring and understanding the performance of task-based applications. SIGPLAN Not., January 2017. https:\/\/doi.org\/10.1145\/3155284.3018770","journal-title":"ACM SIGPLAN Notices"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"Slaughter, E., Lee, W., Treichler, S., Bauer, M., Aiken, A.: Regent: a high-productivity programming language for HPC with logical regions. In: SC15: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201312, November 2015. https:\/\/doi.org\/10.1145\/2807591.2807629","DOI":"10.1145\/2807591.2807629"},{"key":"16_CR29","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.2831","author":"E Tejedor","year":"2012","unstructured":"Tejedor, E., Farreras, M., Grove, D., Badia, R.M., Almasi, G., Labarta, J.: A high-productivity task-based programming model for clusters. Concurr. Comput. Pract. Exp. (2012). https:\/\/doi.org\/10.1002\/cpe.2831","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"16_CR30","unstructured":"Tillenius, M.: SuperGlue: a shared memory framework using data versioning for dependency-aware task-based parallelization. SIAM J. Sci. Comput. (2015). http:\/\/epubs.siam.org\/doi\/10.1137\/140989716"},{"key":"16_CR31","doi-asserted-by":"publisher","unstructured":"Tsugane, K., Lee, J., Murai, H., Sato, M.: Multi-tasking execution in PGAS language XcalableMP and communication optimization on many-core clusters. In: Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region. ACM (2018). https:\/\/doi.org\/10.1145\/3149457.3154482","DOI":"10.1145\/3149457.3154482"},{"key":"16_CR32","unstructured":"YarKhan, A.: Dynamic task execution on shared and distributed memory architectures. Ph.D. thesis (2012)"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Yelick, K., et al.: Productivity and performance using partitioned global address space languages. In: Proceedings of the 2007 International Workshop on Parallel Symbolic Computation, PASCO 2007. ACM (2007)","DOI":"10.1145\/1278177.1278183"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-662-48096-0_29","volume-title":"Euro-Par 2015: Parallel Processing","author":"H Zhou","year":"2015","unstructured":"Zhou, H., Idrees, K., Gracia, J.: Leveraging MPI-3 Shared-memory extensions for efficient PGAS runtime systems. In: Tr\u00e4ff, J.L., Hunold, S., Versaci, F. (eds.) Euro-Par 2015. LNCS, vol. 9233, pp. 373\u2013384. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48096-0_29"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20656-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T05:58:44Z","timestamp":1694930324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20656-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030206550","9783030206567"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20656-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"17 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC High Performance","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on High Performance Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"16 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"supercomputing2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isc-hpc.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Linklings","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","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":"24% - 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":"4-5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"n\/a","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}