{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:40:04Z","timestamp":1747615204145,"version":"3.40.5"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319157887"},{"type":"electronic","value":"9783319157894"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-15789-4_5","type":"book-chapter","created":{"date-parts":[[2015,2,13]],"date-time":"2015-02-13T10:25:31Z","timestamp":1423823131000},"page":"70-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Priority Operators for Fairshare Scheduling"],"prefix":"10.1007","author":[{"given":"Gonzalo P.","family":"Rodrigo","sequence":"first","affiliation":[]},{"given":"Per-Olov","family":"\u00d6stberg","sequence":"additional","affiliation":[]},{"given":"Erik","family":"Elmroth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,14]]},"reference":[{"key":"5_CR1","unstructured":"Raman, R., Livny, M., Solomon, M.: Matchmaking: distributed resource management for high throughput computing. In: Proceedings of the Seventh International Symposium on High Performance Distributed Computing, pp. 140\u2013146. IEEE (1998)"},{"key":"5_CR2","volume-title":"The Grid: Blueprint for a New Computing Infrastructure","author":"I Foster","year":"2004","unstructured":"Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (2004)"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1177\/109434200101500302","volume":"15","author":"I Foster","year":"2001","unstructured":"Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the grid: enabling scalable virtual organizations. Int. J. Supercomput. Appl. 15(3), 200\u2013222 (2001)","journal-title":"Int. J. Supercomput. Appl."},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/35043.35047","volume":"31","author":"J Kay","year":"1988","unstructured":"Kay, J., Lauder, P.: A fair share scheduler. Commun. ACM 31(1), 44\u201355 (1988)","journal-title":"Commun. ACM"},{"key":"5_CR5","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)"},{"key":"5_CR6","unstructured":"Maui Cluster Scheduler, January 2014. http:\/\/www.adaptivecomputing.com\/products\/open-source\/maui\/"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Elmroth, E., Gardfj\u00e4ll, P.: Design and evaluation of a decentralized system for Grid-wide fairshare scheduling. In: Stockinger, H., et al. (eds.) Proceedings of e-Science 2005, pp. 221\u2013229. IEEE CS Press (2005)","DOI":"10.1109\/E-SCIENCE.2005.27"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.future.2012.06.001","volume":"29","author":"P-O \u00d6stberg","year":"2013","unstructured":"\u00d6stberg, P.-O., Espling, D., Elmroth, E.: Decentralized scalable fairshare scheduling. Future Gener. Comput. Syst. 29(1), 130\u2013143 (2013)","journal-title":"Future Gener. Comput. Syst."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"\u00d6stberg, P.-O., Elmroth, E.: Decentralized prioritization-based management systems for distributed computing. In: 2013 IEEE 9th International Conference on eScience (eScience), pp. 228\u2013237. IEEE (2013)","DOI":"10.1109\/eScience.2013.44"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Espling, D., \u00d6stberg, P.-O., Elmroth, E.: Integration and evaluation of decentralized fairshare prioritization (aequus). In: Proceedings of PDSEC 2014 - The 15th IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC 2014), pp. 1198\u20131207. IEEE (2014)","DOI":"10.1109\/IPDPSW.2014.135"},{"key":"5_CR11","unstructured":"SLURM: Multifactor priority plugin - simplified fair-share formula, January 2014. https:\/\/computing.llnl.gov\/linux\/slurm\/priority_multifactor.html"},{"key":"5_CR12","unstructured":"Rodrigo, G.P.: Proof of compliance for the relative operator on the proportional distribution of unused share in an ordering fairshare system, January 2014. http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:umu:diva-89298"},{"key":"5_CR13","unstructured":"Rodrigo, G.P.: Establishing the equivalence between operators, January 2014. http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:umu:diva-89297"},{"key":"5_CR14","unstructured":"Swegrid: Swegrid organization, January 2014. http:\/\/snicdocs.nsc.liu.se\/wiki\/SweGrid"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-45540-X_6","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D Jackson","year":"2001","unstructured":"Jackson, D., Snell, Q., Clement, M.: Core algorithms of the Maui scheduler. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 87\u2013102. Springer, Heidelberg (2001)"},{"key":"5_CR16","unstructured":"CERN: It services - batch service, January 2014. http:\/\/information-technology.web.cern.ch\/services\/batch"},{"key":"5_CR17","unstructured":"LSF: Fairshare scheduling, January 2014. http:\/\/www.ccs.miami.edu\/hpc\/lsf\/7.0.6\/admin\/fairshare.html"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Proceedings of the Real Time Systems Symposium, pp. 166\u2013171. IEEE (1989)","DOI":"10.1109\/REAL.1989.63567"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Sha, L., Lehoczky, J.P., Rajkumar, R.: Task scheduling in distributed real-time systems. In: Robotics and IECON 1987 Conferences, International Society for Optics and Photonics, pp. 909\u2013917 (1987)","DOI":"10.1117\/12.943278"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/317531.317538","volume":"14","author":"JP Lehoczky","year":"1986","unstructured":"Lehoczky, J.P., Sha, L.: Performance of real-time bus scheduling algorithms. ACM SIGMETRICS Perform. Eval. Rev. 14(1), 44\u201353 (1986)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."}],"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-319-15789-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:21:53Z","timestamp":1747614113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15789-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319157887","9783319157894"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15789-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"14 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}