{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:59Z","timestamp":1725664319865},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601531"},{"type":"electronic","value":"9783540494591"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60153-8_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:44:54Z","timestamp":1330278294000},"page":"200-218","source":"Crossref","is-referenced-by-count":18,"title":["A microeconomic scheduler for parallel computers"],"prefix":"10.1007","author":[{"given":"Ion","family":"Stoica","sequence":"first","affiliation":[]},{"given":"Hussein","family":"Abdel-Wahab","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Pothen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0377-2217(91)90304-E","volume":"No. 51","author":"J. Blazewicz","year":"1991","unstructured":"J. Blazewicz, M. Dror and J. Weglarz, \u201cMathematical Programming Formulations for Machine Scheduling: A Survey\u201d, European Journal of Operational Research, No. 51, 1991, pp. 283\u2013300.","journal-title":"European Journal of Operational Research"},{"unstructured":"D. R. Cheriton and K. Harty, \u201cA Market Approach to Operating System Memory Allocation\u201d, URL page: http:\/\/www-dsg.stanford.edu\/Publications.html, Stanford University.","key":"11_CR2"},{"issue":"No.4","key":"11_CR3","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E. G. Coffman","year":"1980","unstructured":"E. G. Coffman, M. R. Garey, D. S. Johnson, R. E. Tarjan, \u201cPerformance Bounds for Level-Oriented Two-Dimensional Packing Algorithms\u201d, SIAM Journal of Computing, Vol. 9, No. 4, November 1980, pp. 808\u2013826.","journal-title":"SIAM Journal of Computing"},{"unstructured":"K. E. Drexler and M. S. Miller, \u201cIncentive Engineering for Computational Resource Management\u201d, in [11], pp. 231\u2013266.","key":"11_CR4"},{"unstructured":"D. G. Feitelson, \u201cA Survey of Scheduling in Multiprogrammed Parallel Systems\u201d, Research Report RC 19790, IBM T.J. Watson Research Center, 1994.","key":"11_CR5"},{"doi-asserted-by":"crossref","unstructured":"D. G. Feitelson and B. Nitzberg, \u201cJob Characteristics of a Production Parallel Scientific Workload on the NASA Ames iPSC\/860\u201d, D. G. Feitelson and L. Rudolph (eds.), Lecture Notes in Computer Science, Vol. 949, Springer-Verlag, 1995.","key":"11_CR6","DOI":"10.1007\/3-540-60153-8_38"},{"doi-asserted-by":"crossref","unstructured":"D. Ferguson, Y. Yemini and C. Nikolau, \u201cMicroeconomic Algorithms for Load Balancing in Distributed Systems\u201d, Proc. of the 8th International Conference on Distributed Computer Systems, IEEE, 1988, pp. 491\u2013499.","key":"11_CR7","DOI":"10.1109\/DCS.1988.12552"},{"key":"11_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San-Francisco, 1979."},{"issue":"No.2","key":"11_CR9","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"R. L. Graham, \u201cBounds on Multiprocessing Timing Anomalies\u201d, SIAM Journal of Applied Mathematics, Vol. 17, No. 2, March 1969, pp. 416\u2013428.","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"No.8","key":"11_CR10","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1109\/32.238584","volume":"19","author":"J. L. Hellerstein","year":"1993","unstructured":"J. L. Hellerstein, \u201cAchieving Service Rate Objectives with Decay Usage Scheduling,\u201d IEEE Transactions on Software Engineering, Vol. 19, No. 8, August 1993, pp. 813\u2013825.","journal-title":"IEEE Transactions on Software Engineering"},{"unstructured":"B. Huberman (ed.), The Ecology of Computation, North-Holland, 1988.","key":"11_CR11"},{"issue":"No.1","key":"11_CR12","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/35043.35047","volume":"31","author":"J. Kay","year":"1988","unstructured":"J. Kay and P. Lauder, \u201cA Fair Share Scheduler\u201d, Communication of the ACM, Vol. 31, No. 1, January 1988, pp. 44\u201345.","journal-title":"Communication of the ACM"},{"doi-asserted-by":"crossref","unstructured":"S. Majumdar, D. L. Eager, and R. B. Bunt, \u201cScheduling in Multiprogrammed Parallel Systems\u201d, Proceedings of the 1988 ACM SIGMETRICS Conference on the Measurement and Modeling of Computer Systems, pp. 104\u2013113.","key":"11_CR13","DOI":"10.1145\/55595.55608"},{"unstructured":"T. W. Malone, R. E. Fikes, K. R. Grant and M. T. Howard, \u201cEnterprise: A Market-Like Task Scheduler for Distributed Computing Environments\u201d, in [11], pp. 177\u2013205.","key":"11_CR14"},{"unstructured":"M. S. Miller and K. E. Drexler, \u201cMarkets and Computation: Agoric Open Systems\u201d, in [11], pp. 133\u2013176.","key":"11_CR15"},{"doi-asserted-by":"crossref","unstructured":"V. K. Naik, S. K. Setia and M. S. Squillante, \u201cPerformance Analysis of Job Scheduling in Parallel Supercomputing Environments\u201d, Research Report RC 19138, IBM T.J. Watson Research Center, 1993.","key":"11_CR16","DOI":"10.1145\/169627.169848"},{"issue":"No.3","key":"11_CR17","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/158439.158908","volume":"25","author":"M. G. Norman","year":"1993","unstructured":"M. G. Norman and P. Thanisch, \u201cModels of Machines and Computation for Mapping in Multicomputers\u201d, ACM Computing Surveys, Vol. 25, No. 3, September 1993, pp. 263\u2013302.","journal-title":"ACM Computing Surveys"},{"unstructured":"K. S. Trivedi, Probability and Statistics with Reliability, Queuing and Computer Science Applications, Prentice-Hall, 1982.","key":"11_CR18"},{"issue":"No.2","key":"11_CR19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/32.121753","volume":"18","author":"C. A. Waldspurger","year":"1992","unstructured":"C. A. Waldspurger, T. Hogg, B. A. Huberman, J. O. Kephart and W. S. Stornetta, \u201cSpawn: A Distributed Computational Economy\u201d, IEEE Transactions on Software Engineering, Vol. 18, No. 2, February 1992, pp. 103\u2013117.","journal-title":"IEEE Transactions on Software Engineering"}],"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-60153-8_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:59Z","timestamp":1619573519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60153-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601531","9783540494591"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-60153-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}