{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:47Z","timestamp":1725566147498},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253303"},{"type":"electronic","value":"9783540317951"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11407522_9","type":"book-chapter","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T20:24:37Z","timestamp":1285273477000},"page":"160-175","source":"Crossref","is-referenced-by-count":15,"title":["Costs and Benefits of Load Sharing in the Computational Grid"],"prefix":"10.1007","author":[{"given":"Darin","family":"England","sequence":"first","affiliation":[]},{"given":"Jon B.","family":"Weissman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Cirne, W., Berman, F.: A comprehensive model of the supercomputer workload. In: 4th Workshop on Workload Characterization (2001)","DOI":"10.1109\/WWC.2001.990753"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Eager, D.L., Lazowska, E.D., Zahorjan, J.: Adaptive load sharing in homogenous distributed systems. IEEE Transactions on Software Engineering\u00a0SE-12 (1986)","DOI":"10.1109\/TSE.1986.6312961"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BFb0022289","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1996","unstructured":"Feitelson, D.G.: Packing schemes for gang scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol.\u00a01162, pp. 89\u2013110. Springer, Heidelberg (1996)"},{"volume-title":"The Grid: Blueprint for a New Computing Infrastructure","year":"1998","key":"9_CR4","unstructured":"Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1998)"},{"key":"9_CR5","unstructured":"The Globus Alliance: Project Website (2003), http:\/\/www.globus.org"},{"key":"9_CR6","volume-title":"Fundamentals of Queueing Theory","author":"D.M. Gross","year":"1985","unstructured":"Gross, D.M., Harris, C.M.: Fundamentals of Queueing Theory, 2nd edn. John Wiley and Sons, Chichester (1985)","edition":"2"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Hollingsworth, J.K., Maneewongvatana, S.: Imprecise calendars: an approach to scheduling computational grids. In: 19th IEEE International Conference on Distributed Computing Systems (1999)","DOI":"10.1109\/ICDCS.1999.776537"},{"key":"9_CR8","volume-title":"Simulation Modeling and Analysis","author":"A.M. Law","year":"1991","unstructured":"Law, A.M., Kelton, W.D.: Simulation Modeling and Analysis, 2nd edn. McGraw-Hill, New York (1991)","edition":"2"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/11407522_14","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"C.B. Lee","year":"2005","unstructured":"Lee, C.B., et al.: Are user runtime estimates inherently inaccurate? In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 253\u2013263. Springer, Heidelberg (2005)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BFb0053979","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"V. Lo","year":"1998","unstructured":"Lo, V., Mache, J., Windisch, K.: A comparative study of real workload traces and synthetic workload models for parallel job scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 25\u201346. Springer, Heidelberg (1998)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Mu\u2019alem, A., Feitelson, D.: Utilization, predictability, workloads, and user run time estimates in scheduling the IBM SP2 with backfilling. IEEE Transactions on Parallel and Distributed Systems\u00a012 (2001)","DOI":"10.1109\/71.932708"},{"key":"9_CR12","unstructured":"Parallel Workload Archive: The Hebrew university of Jerusalem, school of computer science and engineering (2002), http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BFb0053984","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"W. Smith","year":"1998","unstructured":"Smith, W., Foster, I., Taylor, V.: Predicting application run times using historical information. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 122\u2013142. Springer, Heidelberg (1998)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Subramani, V., et al.: Distributed job scheduling on computational grids using multiple simultaneous requests. In: 11th IEEE International Symposium on High Performance Distributed Computing (2002)","DOI":"10.1109\/HPDC.2002.1029936"},{"key":"9_CR15","unstructured":"The TeraGrid Project: A distributed computing infrastructure for scientific research (2003), http:\/\/www.teragrid.org"},{"key":"9_CR16","volume-title":"Probability and Statistics with Reliability, Queueing and Computer Science Applications","author":"K.S. Trivedi","year":"2002","unstructured":"Trivedi, K.S.: Probability and Statistics with Reliability, Queueing and Computer Science Applications, 2nd edn. John Wiley and Sons, Inc., Chichester (2002)","edition":"2"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Vazhkudai, S., et al.: Predicting the performance of wide area data transfers. In: Proceedings of the International Parallel and Distributed Processing Symposium (2002)","DOI":"10.1109\/IPDPS.2002.1015510"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11407522_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:51:08Z","timestamp":1605642668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11407522_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253303","9783540317951"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11407522_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}