{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T18:42:44Z","timestamp":1758393764811,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030882235"},{"type":"electronic","value":"9783030882242"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88224-2_4","type":"book-chapter","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:38:17Z","timestamp":1633459097000},"page":"59-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Measurement and Modeling of Performance of HPC Applications Towards Overcommitting Scheduling Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2553-2148","authenticated-orcid":false,"given":"Shohei","family":"Minami","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7297-6211","authenticated-orcid":false,"given":"Toshio","family":"Endo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2417-1723","authenticated-orcid":false,"given":"Akihiro","family":"Nomura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,6]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1177\/109434209100500306","volume":"5","author":"D Bailey","year":"1991","unstructured":"Bailey, D., et al.: The NAS parallel benchmarks. Int. J. Supercomput. Appl. 5(3), 63\u201373 (1991). https:\/\/doi.org\/10.1177\/109434209100500306","journal-title":"Int. J. Supercomput. Appl."},{"key":"4_CR2","unstructured":"Chen, W., Rao, J., Zhou, X.: Preemptive, low latency datacenter scheduling via lightweight virtualization. In: 2017 USENIX Annual Technical Conference (USENIX ATC 2017), pp. 251\u2013263 (2017)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Delgado, P., Didona, D., Dinu, F., Zwaenepoel, W.: Kairos: preemptive data center scheduling without runtime estimates. In: Proceedings of the ACM Symposium on Cloud Computing, pp. 135\u2013148 (2018)","DOI":"10.1145\/3267809.3267838"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/3-540-45540-X_11","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"DG Feitelson","year":"2001","unstructured":"Feitelson, D.G.: Metrics for parallel job scheduling and their convergence. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 188\u2013205. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45540-X_11"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-63574-2_14","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"DG Feitelson","year":"1997","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: Theory and practice in parallel job scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1997. LNCS, vol. 1291, pp. 1\u201334. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63574-2_14"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-31476-6_7","volume-title":"Tools for High Performance Computing 2011","author":"A Kn\u00fcpfer","year":"2012","unstructured":"Kn\u00fcpfer, A., et al.: Score-P: a joint performance measurement run-time infrastructure for Periscope, Scalasca, TAU, and Vampir. In: Brunst, H., M\u00fcller, M., Nagel, W., Resch, M. (eds.) Tools for High Performance Computing 2011, pp. 79\u201391. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31476-6_7"},{"key":"4_CR7","unstructured":"Matsuoka, S., et al.: Overview of TSUBAME3.0, green cloud supercomputer for convergence of HPC, AI and big-data. TSUBAME e-Science J. 16, 2\u20139 (2017)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Minami, S., Endo, T., Nomura, A.: Performance modeling of HPC applications on overcommitted systems (extended abstract). In: The International Conference on High Performance Computing in Asia-Pacific Region, pp. 129\u2013132 (2021)","DOI":"10.1145\/3432261.3439866"},{"key":"4_CR9","unstructured":"Tau Leng, R.A., Hsieh, J., Mashayekhi, V., Rooholamini, R.: An empirical study of hyper-threading in high performance computing clusters. Linux HPC Revolution 45 (2002)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-11261-4_11","volume-title":"Tools for High Performance Computing 2009","author":"D Terpstra","year":"2010","unstructured":"Terpstra, D., Jagode, H., You, H., Dongarra, J.: Collecting performance data with PAPI-C. In: M\u00fcller, M.S., Resch, M.M., Schulz, A., Nagel, W.E. (eds.) Tools for High Performance Computing 2009, pp. 157\u2013173. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11261-4_11"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-48158-3_27","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"FC Wong","year":"1999","unstructured":"Wong, F.C., Arpaci-Dusseau, A.C., Culler, D.E.: Building MPI for multi-programming systems using implicit information. In: Dongarra, J., Luque, E., Margalef, T. (eds.) EuroPVM\/MPI 1999. LNCS, vol. 1697, pp. 215\u2013222. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48158-3_27"},{"key":"4_CR12","unstructured":"Yabuuchi, H., Taniwaki, D., Omura, S.: Low-latency job scheduling with preemption for the development of deep learning. In: 2019 USENIX Conference on Operational Machine Learning (OpML 2019), pp. 27\u201330 (2019)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/10968987_3","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"AB Yoo","year":"2003","unstructured":"Yoo, A.B., Jette, M.A., Grondona, M.: SLURM: simple Linux utility for resource management. In: Feitelson, D., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 44\u201360. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/10968987_3"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88224-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:41:49Z","timestamp":1633459309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88224-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030882235","9783030882242"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88224-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JSSPP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Job Scheduling Strategies for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jsspp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jsspp.org\/","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":"17","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":"10","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":"59% - 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,4","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":"3","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)"}}]}}