{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:19:23Z","timestamp":1726042763304},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030285951"},{"type":"electronic","value":"9783030285968"}],"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-28596-8_13","type":"book-chapter","created":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T23:02:45Z","timestamp":1566774165000},"page":"186-200","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Toward a Standard Interface for User-Defined Scheduling in OpenMP"],"prefix":"10.1007","author":[{"given":"Vivek","family":"Kale","sequence":"first","affiliation":[]},{"given":"Christian","family":"Iwainsky","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Klemm","sequence":"additional","affiliation":[]},{"given":"Jonas H.","family":"M\u00fcller Kornd\u00f6rfer","sequence":"additional","affiliation":[]},{"given":"Florina M.","family":"Ciorba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"key":"13_CR1","unstructured":"QuickThread: A New C++ Multicore Library, November 2009. \n                      http:\/\/www.drdobbs.com\/parallel\/quickthread-a-new-c-multicore-library\/221800155"},{"key":"13_CR2","unstructured":"LLVM\u2019s OpenMP Compiler, April 2019. \n                      https:\/\/openmp.llvm.org\/"},{"key":"13_CR3","unstructured":"An Enhanced OpenMP Library, January 2018. \n                      https:\/\/github.com\/lapesd\/libgomp\n                      \n                    . Accessed 27 Apr 2018"},{"key":"13_CR4","unstructured":"Banicescu, I.: Load balancing and data locality in the parallelization of the fast multipole algorithm. Ph.D. thesis, New York Polytechnic University (1996)"},{"key":"13_CR5","unstructured":"Banicescu, I., Liu, Z.: Adaptive factoring: a dynamic scheduling method tuned to the rate of weight changes. In: Proceedings of 8th High performance computing Symposium, pp. 122\u2013129. Society for Computer Simulation International (2000)"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1023588520138","volume":"6","author":"I Banicescu","year":"2003","unstructured":"Banicescu, I., Velusamy, V., Devaprasad, J.: On the scalability of dynamic scheduling scientific applications with adaptive weighted factoring. Cluster Comput. 6(3), 215\u2013226 (2003). \n                      https:\/\/doi.org\/10.1023\/A:1023588520138","journal-title":"Cluster Comput."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Bast, H.: Dynamic scheduling with incomplete information. In: Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1998, pp. 182\u2013191. ACM, New York (1998)","DOI":"10.1145\/277651.277684"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-98521-3_2","volume-title":"Evolving OpenMP for Evolving Architectures","author":"FM Ciorba","year":"2018","unstructured":"Ciorba, F.M., Iwainsky, C., Buder, P.: OpenMP loop scheduling revisited: making a case for more schedules. In: de Supinski, B.R., Valero-Lara, P., Martorell, X., Mateo Bellido, S., Labarta, J. (eds.) IWOMP 2018. LNCS, vol. 11128, pp. 21\u201336. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-98521-3_2"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L. Dagum","year":"1998","unstructured":"Dagum, L., Menon, R.: OpenMP: an industry-standard API for shared-memory programming. IEEE Comput. Sci. Eng. 5(1) (1998)","journal-title":"IEEE Computational Science and Engineering"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Donfack, S., Grigori, L., Gropp, W.D., Kale, V.: Hybrid static\/dynamic scheduling for already optimized dense matrix factorizations. In: 2012 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Shanghai, China (2012)","DOI":"10.1109\/IPDPS.2012.53"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Dong, Y., Chen, J., Yang, X., Deng, L., Zhang, X.: Energy-oriented OpenMP parallel loop scheduling. In: 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications, pp. 162\u2013169, December 2008","DOI":"10.1109\/ISPA.2008.68"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1177\/1094342010391989","volume":"25","author":"J Dongarra","year":"2011","unstructured":"Dongarra, J., Beckman, P., et al.: The international exascale software roadmap. Int. J. High Perform. Comput. Appl. 25(1), 3\u201360 (2011)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4615-2315-4_7","volume-title":"Languages, Compilers and Run-Time Systems for Scalable Computers","author":"S Flynn Hummel","year":"1996","unstructured":"Flynn Hummel, S., Banicescu, I., Wang, C.T., Wein, J.: Load balancing and data locality via fractiling: an experimental study. In: Szymanski, B.K., Sinharoy, B. (eds.) Languages, Compilers and Run-Time Systems for Scalable Computers, pp. 85\u201398. Springer, Boston (1996). \n                      https:\/\/doi.org\/10.1007\/978-1-4615-2315-4_7"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Flynn Hummel, S., Schmidt, J., Uma, R.N., Wein, J.: Load-sharing in Heterogeneous Systems via Weighted Factoring. In: Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1996, pp. 318\u2013328. ACM, New York (1996)","DOI":"10.1145\/237502.237576"},{"issue":"8","key":"13_CR15","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/135226.135232","volume":"35","author":"S Flynn Hummel","year":"1992","unstructured":"Flynn Hummel, S., Schonberg, E., Flynn, L.E.: Factoring: a method for scheduling parallel loops. Commun. ACM 35(8), 90\u2013101 (1992)","journal-title":"Commun. ACM"},{"key":"13_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"13_CR17","unstructured":"Govindaswamy, K.: An API for adaptive loop scheduling in shared address space architectures. Master\u2019s thesis, Mississippi State University (2003)"},{"key":"13_CR18","unstructured":"Kale, V., Donfack, S., Grigori, L., Gropp, W.D.: Lightweight scheduling for balancing the tradeoff between load balance and locality. Poster at International Conference on High Performance Computing, Networking, Storage and Analysis (2014)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Kale, V., Gamblin, T., Hoefler, T., de Supinski, B.R., Gropp, W.D.: Abstract: slack-conscious lightweight loop scheduling for improving scalability of bulk-synchronous MPI applications. In: High Performance Computing, Networking Storage and Analysis, SC Companion, p. 1392, November 2012","DOI":"10.1109\/SC.Companion.2012.209"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-15646-5_24","volume-title":"Recent Advances in the Message Passing Interface","author":"V Kale","year":"2010","unstructured":"Kale, V., Gropp, W.: Load balancing for regular meshes on SMPs with MPI. In: Keller, R., Gabriel, E., Resch, M., Dongarra, J. (eds.) EuroMPI 2010. LNCS, vol. 6305, pp. 229\u2013238. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-15646-5_24"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-24595-9_2","volume-title":"OpenMP: Heterogenous Execution and Data Movements","author":"V Kale","year":"2015","unstructured":"Kale, V., Gropp, W.D.: Composing low-overhead scheduling strategies for improving performance of scientific applications. In: Terboven, C., de Supinski, B.R., Reble, P., Chapman, B.M., M\u00fcller, M.S. (eds.) IWOMP 2015. LNCS, vol. 9342, pp. 18\u201329. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-24595-9_2"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Kasielke, F., Tsch\u00fcter, R., Iwainsky, C., Velten, M., Ciorba, F.M., Banicescu, I.: Exploring loop scheduling enhancements in OpenMP: an LLVM case study. In: Proceedings of the 18th International Symposium on Parallel and Distributed Computing (ISPDC 2019), Amsterdam, June 2019","DOI":"10.1109\/ISPDC.2019.00026"},{"issue":"6","key":"13_CR23","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/32.295892","volume":"20","author":"P Krueger","year":"1994","unstructured":"Krueger, P., Shivaratri, N.G.: Adaptive location policies for global scheduling. IEEE Trans. Softw. Eng. 20(6), 432\u2013444 (1994)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"10","key":"13_CR24","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1109\/TSE.1985.231547","volume":"SE\u201311","author":"CP Kruskal","year":"1985","unstructured":"Kruskal, C.P., Weiss, A.: Allocating independent subtasks on parallel processors. IEEE Trans. Softw. Eng. SE\u201311(10), 1001\u20131016 (1985)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Li, H., Tandri, S., Stumm, M., Sevcik, K.C.: Locality and loop scheduling on NUMA multiprocessors. In: Proceedings of the 1993 International Conference on Parallel Processing, ICPP 1993, Washington, DC, USA, vol. 2, pp. 140\u2013147. IEEE Computer Society (1993)","DOI":"10.1109\/ICPP.1993.112"},{"issue":"12","key":"13_CR26","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1109\/TC.1987.5009495","volume":"C\u201336","author":"CD Polychronopoulos","year":"1987","unstructured":"Polychronopoulos, C.D., Kuck, D.J.: Guided self-scheduling: a practical scheduling scheme for parallel supercomputers. IEEE Trans. Comput. C\u201336(12), 1425\u20131439 (1987)","journal-title":"IEEE Trans. Comput."},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Rountree, B., Lowenthal, D.K., de Supinski, B.R., Schulz, M., Freeh, V.W., Bletsch, T.: Adagio: making DVS practical for complex HPC applications. In: Proceedings of the 23rd International Conference on Supercomputing, ICS 2009, Yorktown Heights, NY, USA, pp. 460\u2013469. ACM (2009)","DOI":"10.1145\/1542275.1542340"},{"issue":"3","key":"13_CR28","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1109\/TPDS.2017.2766062","volume":"29","author":"S Seo","year":"2018","unstructured":"Seo, S., et al.: Argobots: a lightweight low-level threading and tasking framework. IEEE Trans. Parallel Distrib. Syst. 29(3), 512\u2013526 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"13_CR29","unstructured":"Tang, P., Yew, P.C.: Processor self-scheduling for multiple-nested parallel loops. In: Proceedings of International Conference on Parallel Processing, pp. 528\u2013535. IEEE, December 1986"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-30961-8_7","volume-title":"OpenMP in a Heterogeneous World","author":"P Thoman","year":"2012","unstructured":"Thoman, P., Jordan, H., Pellegrini, S., Fahringer, T.: Automatic OpenMP loop scheduling: a combined compiler and runtime approach. In: Chapman, B.M., Massaioli, F., M\u00fcller, M.S., Rorro, M. (eds.) IWOMP 2012. LNCS, vol. 7312, pp. 88\u2013101. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-30961-8_7"},{"issue":"1","key":"13_CR31","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/71.205655","volume":"4","author":"TH 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(1), 87\u201398 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Wang, Y., Nicolau, A., Cammarota, R., Veidenbaum, A.V.: A fault tolerant self-scheduling scheme for parallel loops on shared memory systems. In: 2012 19th International Conference on High Performance Computing, pp. 1\u201310, December 2012","DOI":"10.1109\/HiPC.2012.6507476"},{"key":"13_CR33","unstructured":"Zhang, Y., Voss, M.: Runtime empirical selection of loop schedulers on hyperthreaded SMPs. In: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2005) - Papers - Volume 01, IPDPS 2005, Washington, DC, USA, p. 44.2. IEEE Computer Society (2005)"}],"container-title":["Lecture Notes in Computer Science","OpenMP: Conquering the Full Hardware Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-28596-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T23:34:31Z","timestamp":1566776071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-28596-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030285951","9783030285968"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28596-8_13","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":"9 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOMP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on OpenMP","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","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":"11 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwomp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/parallel.auckland.ac.nz\/iwomp2019\/","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":"23","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":"22","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":"96% - 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.8","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":"0","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)"}}]}}