{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:48Z","timestamp":1725664368548},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615767"},{"type":"electronic","value":"9783540706274"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996]]},"DOI":"10.1007\/3-540-61576-8_94","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:57:55Z","timestamp":1330293475000},"page":"341-347","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture"],"prefix":"10.1007","author":[{"given":"H\u00e5kan","family":"Lennerstad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Lundberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"No.1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"E. G. Coffman Jr.","year":"1978","unstructured":"E. G. Coffman Jr., M. R. Garey and D. S. Johnson, An Application of Bin Packing to Multiprocessor Scheduling, SIAM Journal of Computing, Vol. 7, No. 1, February 1978, pp. 1\u201317.","journal-title":"SIAM Journal of Computing"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/0213013","volume":"13","author":"D. K. Friesen","year":"1984","unstructured":"D. K. Friesen, Tighter bounds for the multifit processor scheduling algorithm, SIAM Journal of Computing, 13 (1984), pp. 170\u2013181.","journal-title":"SIAM Journal of Computing"},{"key":"28_CR3","unstructured":"M. Garey and D. Johnson, Computers and Intractability, W.H. Freeman and Company, 1979."},{"issue":"No.2","key":"28_CR4","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Journal of Applied Mathematics, Vol. 17, No. 2, March 1969, pp. 416\u2013429.","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"No.1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D. S. Hochbaum","year":"1987","unstructured":"D. S. Hochbaum and D. B. Shmoys, Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results, Journal of the ACM, Vol. 34, No. 1, January 1987, pp. 144\u2013162.","journal-title":"Journal of the ACM"},{"key":"28_CR6","volume-title":"Ph.D. thesis","author":"M. A. Langstone","year":"1981","unstructured":"M. A. Langstone, Processor scheduling with improved heuristic algorithms, Ph.D. thesis Texas University, Collage Station Texas, 1981."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"H. Lennerstad and L. Lundberg, An Optimal Execution Time Estimate for Static versus Dynamic Allocation in Multiprocessor Systems, SIAM Journal of Computing, August 1995.","DOI":"10.1137\/S0097539792240571"},{"key":"28_CR8","volume-title":"Research Report 3\/93","author":"H. Lennerstad","year":"1993","unstructured":"H. Lennerstad and L. Lundberg, Optimal Performance Functions Comparing Process Allocation Strategies in Multiprocessor Systems, Research Report 3\/93. University of Karlskrona\/Ronneby, Sweden, 1993."},{"key":"28_CR9","unstructured":"H. Lennerstad and L. Lundberg, Optimal scheduling results for parallel computing, SIAM News, Vol. 27, No. 7, 1994 (survey article)."},{"key":"28_CR10","volume-title":"Research Report 5\/95","author":"H. Lennerstad","year":"1995","unstructured":"H. Lennerstad and L. Lundberg, Optimal Worst Case Formulas Comparing Cache Memory Associativity, Research Report 5\/95, University of Karlskrona\/Ronneby, Sweden, 1995."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"L. Lundberg and H. Lennerstad, An Optimal Upper Bound on the Minimal Completion Time in Distributed Supercomputing, in Proceedings of the 8th ACM Conference on Supercomputing, Manchester, England, July 1994.","DOI":"10.1145\/181181.181339"},{"key":"28_CR12","unstructured":"L. Lundberg and H. Lennerstad, An Optimal Lower Bound on the Maximum Speedup in Multiprocessors with Clusters, in Proceedings of the First International Conference on Algorithms and Architectures for parallel Processing, Brisbane, Australia, April 1995."},{"key":"28_CR13","unstructured":"L. Lundberg and H. Lennerstad, An optimal bound on the gain of using one large processor cluster instead of a number of small clusters, in Proceedings of the 8th International Conference on Parallel and Distributed Computing Systems, Orlando, Florida, September 1995."},{"key":"28_CR14","volume-title":"Technical Report","author":"L. Lundberg","year":"1994","unstructured":"L. Lundberg and H. Lennerstad, Bounding the Maximum Gain of Changing the Number of Modules in Multiprocessor Computers, Technical Report May 1994 Department of Comp. Engineering, Lund University, Sweden."},{"key":"28_CR15","unstructured":"A. Silberschatz, J. Peterson and P. Galvin, Operating System Concepts (third edition), Addison-Wesley Publishing Company, 1991."}],"container-title":["Lecture Notes in Computer Science","Combinatorics and Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61576-8_94","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:47:45Z","timestamp":1558270065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61576-8_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615767","9783540706274"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61576-8_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}