{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:51:14Z","timestamp":1762444274079},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635741"},{"type":"electronic","value":"9783540695998"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63574-2_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:30:06Z","timestamp":1330281006000},"page":"95-116","source":"Crossref","is-referenced-by-count":60,"title":["Modeling of workload in MPPs"],"prefix":"10.1007","author":[{"given":"Joefon","family":"Jann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratap","family":"Pattnaik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hubertus","family":"Franke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Skovira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Riordan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,12]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"A. Tucker and A. Gupta, \u201cProcess control and scheduling issues for multiprogrammed shared-memory multiprocessors,\u201d in Proceedings of the 12th. ACM Symposium on Operating Systems Principle, pp. 159\u2013166,1989.","DOI":"10.1145\/74850.74866"},{"key":"5_CR2","unstructured":"D. Feitelson and L. Rudolph, \u201cMapping and scheduling in a shared parallel environment using distributed hierarchical control,\u201d in Intl. Conf Parallel Processing, pp. 1\u20138, 1990."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"D. G. Feitelson, \u201cPacking schemes for gang scheduling,\u201d in Job Scheduling Strategies for Parallel Processing Springer-Verlag, LNCS Vol. 1162, Apr 1996, pp. 89\u2013110,1996.","DOI":"10.1007\/BFb0022289"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"F. Wang, H. Franke, M. Papaefthymiou, P Pattnaik, L. Rudolph, and M. S. Squillante, \u201cA gang scheduling design for multiprogrammed parallel computing environments,\u201d in Job Scheduling Strategies for Parallel Processing Springer-Verlag, LNCS Vol. 1162, Apr 1996, pp. 111\u2013125,1996.","DOI":"10.1007\/BFb0022290"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"M. S. Squillante, F. Wang, and M. Papaefthymiou, \u201cAn analysis of gang scheduling for multiprogrammed parallel computing environments,\u201d in Proceedings of the Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 89\u201398, 1996.","DOI":"10.1145\/237502.237511"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"H. Franke, P Pattnaik, and L. Rudolph, \u201cGang scheduling for highly efficient distributed multiprocessor systems,\u201d in Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation, Annapolis, MD, pp. 1\u20139, 1996.","DOI":"10.1109\/FMPC.1996.558056"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"D. R. Cox, \u201cA use of complex probabilities in the theory of stochastic process,\u201d Proc. Cambridge Philos. Soc, 1955.","DOI":"10.1017\/S0305004100030231"},{"key":"5_CR8","unstructured":"M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models. The John Hopkins University Press, 1981."},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1080\/15326348908807131","volume":"5","author":"M. A. Johnson","year":"1989","unstructured":"M. A. Johnson and M. R. Taaffe, \u201cMatching moments to phase distributions,\u201d Commun. Stat. Stochastics Models, vol. 5, pp. 711\u2013743, 1989.","journal-title":"Commun. Stat. Stochastics Models"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"R. Schassberger, \u201cInsensitivity of steady-state distributions of generalized semi-markov processes i,\u201d Ann. Prob., pp. 87\u201399,1977.","DOI":"10.1214\/aop\/1176995893"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"R. Schassberger, \u201cInsensitivity of steady-state distributions of generalized semi-markov processes ii,\u201d Ann. Prob., pp. 85\u201393, 1978.","DOI":"10.1214\/aop\/1176995612"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"R. Schassberger, \u201cInsensitivity of steady-state distributions of generalized semi-markov processes with speeds,\u201d Adv. Appl. Prob., pp. 836\u2013851,1978.","DOI":"10.1017\/S0001867800031402"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"R. Schassberger, \u201cThe insensitivity of stationary probabilities in networks of queues,\u201d Adv. Appl. Prob., pp. 906\u2013912, 1978.","DOI":"10.1017\/S000186780003144X"}],"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\/3-540-63574-2_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:18:59Z","timestamp":1605629939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63574-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635741","9783540695998"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-63574-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}