{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:29:46Z","timestamp":1743006586325,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030447274"},{"type":"electronic","value":"9783030447281"}],"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-44728-1_2","type":"book-chapter","created":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T12:02:56Z","timestamp":1585137776000},"page":"28-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Using Malleable Task Scheduling to Accelerate Package Manager Installations"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Knight","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremiah","family":"Wilke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Todd","family":"Gamblin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,26]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the April 18\u201320, 1967, Spring Joint Computer Conference, AFIPS 1967 (Spring), pp. 483\u2013485. ACM, New York (1967). \nhttps:\/\/doi.org\/10.1145\/1465482.1465560\n\n, \nhttp:\/\/doi.acm.org\/10.1145\/1465482.1465560","DOI":"10.1145\/1465482.1465560"},{"issue":"10","key":"2_CR2","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1016\/j.parco.2006.08.004","volume":"32","author":"S Bansal","year":"2006","unstructured":"Bansal, S., Kumar, P., Singh, K.: An improved two-step algorithm for task and data parallel scheduling in distributed memory machines. Parallel Comput. 32(10), 759\u2013774 (2006). \nhttps:\/\/doi.org\/10.1016\/j.parco.2006.08.004\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167819106000524","journal-title":"Parallel Comput."},{"key":"2_CR3","unstructured":"Bartlett, R., et al.: xSDK foundations: toward an extreme-scale scientific software development kit. Supercomput. Front. Innov. 4(1) (2017). \nhttp:\/\/superfri.org\/superfri\/article\/view\/127"},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman Jr","year":"1972","unstructured":"Coffman Jr., E.G., Graham, R.L.: Optimal scheduling for two-processor systems. Acta Informatica 1(3), 200\u2013213 (1972). \nhttps:\/\/doi.org\/10.1007\/BF00288685","journal-title":"Acta Informatica"},{"key":"2_CR5","unstructured":"xSDK contributors: xsdk home (2019). \nhttps:\/\/xsdk.info\/"},{"key":"2_CR6","unstructured":"Spack Contributors: Spack (2019). \nhttps:\/\/spack.io\/\n\n. Accessed 27 Feb 2019"},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J Du","year":"1989","unstructured":"Du, J., Leung, J.Y.T.: Complexity of scheduling parallel task systems. SIAM J. Discrete Math. 2(4), 473\u2013487 (1989). \nhttps:\/\/doi.org\/10.1137\/0402042","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Gamblin, T., et al.: The Spack package manager: bringing order to HPC software chaos. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2015, pp. 40:1\u201340:12. ACM, New York (2015). \nhttps:\/\/doi.org\/10.1145\/2807591.2807623\n\n, \nhttp:\/\/doi.acm.org\/10.1145\/2807591.2807623","DOI":"10.1145\/2807591.2807623"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0208031","volume":"8","author":"CH Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Scheduling interval-ordered tasks. SIAM J. Comput. 8, 405\u2013409 (1979). \nhttps:\/\/doi.org\/10.1137\/0208031","journal-title":"SIAM J. Comput."},{"issue":"6","key":"2_CR10","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"TC Hu","year":"1961","unstructured":"Hu, T.C.: Parallel sequencing and assembly line problems. Oper. Res. 9(6), 841\u2013848 (1961). \nhttp:\/\/www.jstor.org\/stable\/167050","journal-title":"Oper. Res."},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1186\/s40064-016-2808-y","volume":"5","author":"KC Huang","year":"2016","unstructured":"Huang, K.C., Wu, W.Y., Wang, F.J., Liu, H.C., Hung, C.H.: An iterative expanding and shrinking process for processor allocation in mixed-parallel workflow scheduling. SpringerPlus 5(1), 1138 (2016). \nhttps:\/\/doi.org\/10.1186\/s40064-016-2808-y","journal-title":"SpringerPlus"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"YK Kwok","year":"1999","unstructured":"Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31(4), 406\u2013471 (1999). \nhttps:\/\/doi.org\/10.1145\/344588.344618\n\n. \nhttp:\/\/doi.acm.org\/10.1145\/344588.344618","journal-title":"ACM Comput. Surv."},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Radulescu, A., van Gemund, A.J.C.: A low-cost approach towards mixed task and data parallel scheduling. In: International Conference on Parallel Processing 2001, pp. 69\u201376 (2001). \nhttps:\/\/doi.org\/10.1109\/ICPP.2001.952048","DOI":"10.1109\/ICPP.2001.952048"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Radulescu, A., Nicolescu, C., van Gemund, A.J.C., Jonker, P.P.: CPR: mixed task and data parallel scheduling for distributed systems. In: IPDPS (2001)","DOI":"10.1109\/ICPP.2001.952048"},{"issue":"11","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/71.642945","volume":"8","author":"S Ramaswamy","year":"1997","unstructured":"Ramaswamy, S., Sapatnekar, S., Banerjee, P.: A framework for exploiting task and data parallelism on distributed memory multicomputers. IEEE Trans. Parallel Distrib. Syst. 8(11), 1098\u20131116 (1997). \nhttps:\/\/doi.org\/10.1109\/71.642945","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0205005","volume":"5","author":"R Sethi","year":"1976","unstructured":"Sethi, R.: Scheduling graphs on two processors. SIAM J. Comput. 5, 73\u201382 (1976). \nhttps:\/\/doi.org\/10.1137\/0205005","journal-title":"SIAM J. Comput."},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Vydyanathan, N., et al.: Locality conscious processor allocation and scheduling for mixed parallel applications. In: 2006 IEEE International Conference on Cluster Computing, pp. 1\u201310 (2006). \nhttps:\/\/doi.org\/10.1109\/CLUSTR.2006.311861","DOI":"10.1109\/CLUSTR.2006.311861"}],"container-title":["Communications in Computer and Information Science","Tools and Techniques for High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44728-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T23:07:44Z","timestamp":1585177664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44728-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030447274","9783030447281"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44728-1_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HUST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Workshop on HPC User Support Tools","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denver, CO","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hust2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hust-workshop.github.io\/","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":"Linklings","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","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":"4","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":"100% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}