{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:52:34Z","timestamp":1649001154629},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T00:00:00Z","timestamp":1288051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10586-010-0141-8","type":"journal-article","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T11:40:11Z","timestamp":1288006811000},"page":"165-182","source":"Crossref","is-referenced-by-count":1,"title":["Service control with the preemptive parallel job scheduler Scojo-PECT"],"prefix":"10.1007","volume":"14","author":[{"given":"A. C.","family":"Sodan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,26]]},"reference":[{"key":"141_CR1","doi-asserted-by":"crossref","unstructured":"Brevic, J., Nurmi, D., Wolski, R.: Predicting bounds on queuing delay in space-shared computing environments. In: Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) (2006)","DOI":"10.1109\/IISWC.2006.302746"},{"key":"141_CR2","volume-title":"Proc. DoD Users Group Conference","author":"L. Carrington","year":"2004","unstructured":"Carrington, L., Wolter, N., Snavely, A., Lee, C.B.: Applying an automated framework to produce accurate blind performance predictions of full-scale HPC applications. In: Proc. DoD Users Group Conference. IEEE Press, New York (2004)"},{"key":"141_CR3","unstructured":"Chiang, S.H., Fu, C.: Benefit of limited time sharing in the presence of very large parallel jobs. In: Proc. IPDPS. IEEE (2005)"},{"key":"141_CR4","series-title":"LNCS","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"S.H. Chiang","year":"2001","unstructured":"Chiang, S.H., Vernon, M.: Characteristics of a large shared memory production workload. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol.\u00a02221. Springer, Berlin (2001)"},{"key":"141_CR5","unstructured":"Downey, A.: Predicting queue times on space-sharing parallel computers. In: Proc. IPPS (1997)"},{"key":"141_CR6","series-title":"LNCS","volume-title":"Proc. High Performance Computing and Communication (HPCC)","author":"B. Esbaugh","year":"2007","unstructured":"Esbaugh, B., Sodan, A.: Coarse-grain time slicing with resource-share control in parallel-job scheduling. In: Proc. High Performance Computing and Communication (HPCC). LNCS, vol.\u00a04782. Springer, Berlin (2007)"},{"key":"141_CR7","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-63574-2","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"D. Feitelson","year":"1997","unstructured":"Feitelson, D., Jette, M.: Improved utilization and responsiveness with gang scheduling. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol.\u00a01291. Springer, Berlin (1997)"},{"key":"141_CR8","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0022283","volume-title":"Proc. Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"D.G. Feitelson","year":"1996","unstructured":"Feitelson, D.G.: Packing schemes for gang scheduling. In: Proc. Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol. 1162. Springer, Berlin (1996)"},{"key":"141_CR9","doi-asserted-by":"crossref","unstructured":"Frachtenberg, E., Petrini, F., Fernandez, J., Pakin, S., Coll, S.: Storm: lightning-fast resource management. In: Proc. IEEE\/ACM Supercomputing Conference (2002)","DOI":"10.1109\/SC.2002.10057"},{"key":"141_CR10","series-title":"LNCS","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"G. Ghare","year":"1999","unstructured":"Ghare, G., Leutenegger, S.T.: The effect of correlating quantum allocation and job size for gang scheduling. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol. 1659. Springer, Berlin (1999)"},{"key":"141_CR11","series-title":"LNCS","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"R. Gibbons","year":"1997","unstructured":"Gibbons, R.: A historical application profiler for use by parallel schedulers. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol. 1291. Springer, Berlin (1997)"},{"key":"141_CR12","unstructured":"Houten, B.V., Ciesielski, F., Brebner, G., Jacquelot, G., Riedmann, M., Strauss, H.: Advanced cluster software for meteorology. In: ECMWF Workshop (2006)"},{"key":"141_CR13","series-title":"LNCS","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"M. Islam","year":"2003","unstructured":"Islam, M., Balaji, P., Sandayappan, P., Panda, D.: QoPS: A QoS based scheme for parallel job scheduling. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol. 2862. Springer, Berlin (2003)"},{"key":"141_CR14","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-45540-X_6","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"D. Jackson","year":"2001","unstructured":"Jackson, D., Snell, Q., Clement, M.: Core algorithms of the Maui scheduler. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol. 2221, pp. 87\u2013102. Springer, Berlin (2001)"},{"key":"141_CR15","volume-title":"Proc. ICPP","author":"R. Kettimuthu","year":"2002","unstructured":"Kettimuthu, R., Subramani, V., Srinivasan, S., Gopalasamy, T.: Selective preemption strategies for parallel job scheduling. In: Proc. ICPP. IEEE Press, New York (2002)"},{"key":"141_CR16","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/3-540-63574-2_23","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"W. Lee","year":"1997","unstructured":"Lee, W., Frank, M., Lee, V., Mackenzie, K., Rudolph, L.: Implications of I\/O for gang scheduled workloads. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol. 1291, pp. 215\u2013237. Springer, Berlin (1997)"},{"key":"141_CR17","volume-title":"Proc. Int. Symposium on Cluster Computing and the Grid (CCGrid)","author":"H. Li","year":"2006","unstructured":"Li, H., Chen, J., Tao, Y., Groep, D., Wolters, L.: Improving a local learning technique for queue wait time prediction. In: Proc. Int. Symposium on Cluster Computing and the Grid (CCGrid), Singapore (2006)"},{"issue":"11","key":"141_CR18","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1016\/S0743-7315(03)00108-4","volume":"63","author":"U. Lublin","year":"2003","unstructured":"Lublin, U., Feitelson, D.: The workload on parallel supercomputers\u2014modelling the characteristics of rigid jobs. J. Parallel Distrib. Comput. 63(11), 1105\u20131122 (2003)","journal-title":"J. Parallel Distrib. Comput."},{"key":"141_CR19","unstructured":"Moab workload manager administrator\u2019s guide, Version 5.0.0. cluster resources. Available at http:\/\/www.clusterresources.com\/products\/mwm\/docs\/index.shtml (retrieved August 2008)"},{"key":"141_CR20","doi-asserted-by":"crossref","unstructured":"Moreira, J., Chan, W., Fong, L., Franke, H., Jette, M.: An infrastructure for efficient parallel job execution in terascale computing environments. In: Proc. ACM\/IEEE Supercomputing (1998)","DOI":"10.1109\/SC.1998.10026"},{"key":"141_CR21","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"A. Mu\u00e1lem","year":"2001","unstructured":"Mu\u00e1lem, A., Feitelson, D.: Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Trans. Parallel Distrib. Syst. 12, 529\u2013543 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"141_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2426-4","volume-title":"Probability, Stochastic Processes, and Queueing Theory","author":"R. Nelson","year":"1995","unstructured":"Nelson, R.: Probability, Stochastic Processes, and Queueing Theory. Springer, New York\/Berlin\/Heidelberg (1995)"},{"key":"141_CR23","series-title":"LNCS","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"G. Sabin","year":"2005","unstructured":"Sabin, G., Sadayapan, P.: Unfairness metrics for space-sharing parallel job schedulers. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol. 3834. Springer, Berlin (2005)"},{"issue":"4","key":"141_CR24","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/309746.309751","volume":"26","author":"S. Setia","year":"1999","unstructured":"Setia, S., Squillante, M., Naik, V.: The impact of job memory requirements on gang-scheduling performance. Perform. Eval. Rev. 26(4), 30\u201339 (1999)","journal-title":"Perform. Eval. Rev."},{"key":"141_CR25","unstructured":"Sharcnet network of clusters. Available at http:\/\/www.sharcnet.ca (retrieved Sept. 2009)"},{"key":"141_CR26","series-title":"LNCS","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"W. Smith","year":"1999","unstructured":"Smith, W., Taylor, V., Foster, I.: Using run-time predictions to estimate queue wait times and improve scheduler performance. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol. 1659. Springer, Berlin (1999)"},{"key":"141_CR27","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-36180-4_2","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"Q. Snell","year":"2002","unstructured":"Snell, Q., Clement, M., Jackson, D.: Preemption based backfill. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol. 2537, pp. 24\u201337. Springer, Berlin (2002)"},{"key":"141_CR28","doi-asserted-by":"crossref","unstructured":"Sodan, A.: Loosely coordinated coscheduling in the context of other dynamic approaches for job scheduling\u2014a survey (2005)","DOI":"10.1002\/cpe.887"},{"key":"141_CR29","volume-title":"Proc. Workshop on Adaptive Grid Computing (NCA-AGC)","author":"A. Sodan","year":"2008","unstructured":"Sodan, A.: Autonomic share allocation and bounded prediction of response times in job scheduling for computational grids. In: Proc. Workshop on Adaptive Grid Computing (NCA-AGC). IEEE, Cambridge (2008)"},{"key":"141_CR30","volume-title":"Proc. ICPP Workshop on Scheduling and Resource Management for Parallel and Distritbuted Systems (SRMPDS)","author":"A. Sodan","year":"2010","unstructured":"Sodan, A.: Predictive space- and time-resource allocation in parallel job scheduling for clusters, grids, and clouds. In: Proc. ICPP Workshop on Scheduling and Resource Management for Parallel and Distritbuted Systems (SRMPDS). IEEE, San Diego (2010)"},{"key":"141_CR31","volume-title":"Proc. Conf. on High Performance Computing Systems and Applications (HPCS)","author":"A.C. Sodan","year":"2008","unstructured":"Sodan, A.C., Kanavallil, A., Esbaugh, B.: Group-based optimization for parallel job scheduling with Scojo-PECT-O. In: Proc. Conf. on High Performance Computing Systems and Applications (HPCS). IEEE, Quebec City (2008)"},{"key":"141_CR32","volume-title":"Proc. IPPS","author":"D. Talby","year":"1999","unstructured":"Talby, D., Feitelson, D.: Supporting priorities and improving utilization of the IBM SP2 scheduler using slack-based backfilling. In: Proc. IPPS. IEEE Press, New York (1999)"},{"issue":"6","key":"141_CR33","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1109\/TPDS.2007.70606","volume":"18","author":"D. Tsafrir","year":"2007","unstructured":"Tsafrir, D., Etsion, Y., Feitelson, D.: Backfilling using system-generated predictions rather than user runtime estimates. IEEE Trans. Parallel Distrib. Syst. 18(6), 789\u2013803 (2007)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"18","key":"141_CR34","doi-asserted-by":"crossref","first-page":"3679","DOI":"10.1016\/j.comcom.2006.06.009","volume":"29","author":"J. Wei","year":"2006","unstructured":"Wei, J., Xu, C.Z., Li, Q.: A robust packet scheduling algorithm for proportional delay differentiation services. Comput. Commun. 29(18), 3679\u20133690 (2006)","journal-title":"Comput. Commun."},{"key":"141_CR35","unstructured":"Feitelson workload archive. Available at http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/logs.html (retrieved July 2009)"},{"key":"141_CR36","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/11605300_7","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"K. Yoshimoto","year":"2005","unstructured":"Yoshimoto, K., Kovatch, P., Andrews, P.: Co-scheduling with user-settable reservations. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol. 3834, pp. 146\u2013156. Springer, Berlin (2005)"},{"key":"141_CR37","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/TPDS.2003.1189582","volume":"14","author":"Y. Zhang","year":"2003","unstructured":"Zhang, Y., Franke, H., Moreira, J., Sivasubramaniam, A.: An integrated approach to parallel scheduling using gang-scheduling, backfilling, and migration. IEEE Trans. Parallel Distrib. Syst. 14, 236 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"141_CR38","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/10968987_10","volume-title":"Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"Y. Zhang","year":"2003","unstructured":"Zhang, Y., Yang, A., Sivasubramaniam, A., Moreira, J.: Gang scheduling extensions for I\/O intensive workloads. In: Proc. Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). LNCS, vol. 2862, pp. 183\u2013207. Springer, Berlin (2003)"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-010-0141-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-010-0141-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-010-0141-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T17:21:57Z","timestamp":1559755317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-010-0141-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,26]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["141"],"URL":"https:\/\/doi.org\/10.1007\/s10586-010-0141-8","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,26]]}}}