{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:19:35Z","timestamp":1725455975473},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616276"},{"type":"electronic","value":"9783540706366"}],"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\/bfb0024749","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:17:56Z","timestamp":1132384676000},"page":"563-572","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized multiprocessor scheduling"],"prefix":"10.1007","author":[{"given":"Zhonghua","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris C.","family":"Kirkham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"72_CR1","unstructured":"K. P. Belkhale and P. Banerjee. A Scheduling Algorithm For Parallelizable Dependent Tasks. In 1991 International Parallel Processing Symposium, 1991."},{"key":"72_CR2","unstructured":"V. G. Boltyanskii. Mathematical Methods of Optimal Control. Holt, Rinehart and Winston, Inc., translation edition, 1971."},{"issue":"4","key":"72_CR3","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"Jianzhong Du and Joseph Y-T. Leung. Complexity of Scheduling Parallel Task Systems. SIAM Journal of Discrete Mathematics, 2(4):473\u2013487, November 1989.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"72_CR4","volume-title":"Computer and Job Shop Sheduling Theory","year":"1976","unstructured":"Coffman E.F., editor. Computer and Job Shop Sheduling Theory. John Wiley and Sons, N.Y., first edition, 1976.","edition":"first edition"},{"key":"72_CR5","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. W.H. Freeman, San Francisco, 1979."},{"issue":"4","key":"72_CR6","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1137\/0909041","volume":"9","author":"J. L. Gustafson","year":"1988","unstructured":"John L. Gustafson, Gary R. Montry, and Robert E. Benner. Development of Parallel Methods For a 1024-Processor Hypercube. SIAM Journal on Scientific and Satastical Computing, 9(4):609\u2013638, July 1988.","journal-title":"SIAM Journal on Scientific and Satastical Computing"},{"key":"72_CR7","unstructured":"Zhonghua Li. Scheduling and Partitioning of Parallel Programs. PhD thesis, Manchester University, 1996. in preparation."},{"key":"72_CR8","unstructured":"M.J.D. Powell. A Hybrid Method for Nonlinear Algebraic Equations. In P. Rabinowitz, editor, Numerical Methods for Nonlinear Algebraic Equations, 1970."},{"issue":"7","key":"72_CR9","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1109\/71.296318","volume":"5","author":"G. S. Prasanna","year":"1994","unstructured":"G.N. Srinivasa Prasanna, A. Agarwal, and B. R. Musicus. Hierarchical Compilation of Macro Dataflow Graphs for Multiprocessors with Local Memory. IEEE Transactions on Parallel and Distributed Systems, 5(7):720\u2013736, July 1994.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"72_CR10","doi-asserted-by":"crossref","unstructured":"G.N. Srinivasa Prasanna and Bruce R. Musicus. Generalized Multiprocessor Scheduling for Directed Acyclic Graphs. In Supercomputing'94, 1994.","DOI":"10.1145\/602770.602812"},{"key":"72_CR11","doi-asserted-by":"crossref","unstructured":"S. Ramaswamy and P. Banerjee. Processor Allocation and Scheduling of Macro Dataflow Graphs on Distributed Memory Multicomputers by the PARADIGM Compiler. In International Conference on Parallel Processing, 1993.","DOI":"10.1109\/ICPP.1993.153"},{"key":"72_CR12","unstructured":"P. Shi. Articulating the Power of Parallelism Using Steady State Timing Models. Technical report, Computer and Information Sciences Department, Temple University, May 1995."}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:35:16Z","timestamp":1587342916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616276","9783540706366"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0024749","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":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}