{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T18:22:11Z","timestamp":1746728531975},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649526"},{"type":"electronic","value":"9783540499206"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/bfb0057875","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T15:01:27Z","timestamp":1154444487000},"page":"367-372","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A lower bound for dynamic scheduling of data parallel programs"],"prefix":"10.1007","author":[{"given":"Fabricio Alves Barbosa da","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis Miguel","family":"Campos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isaac D.","family":"Scherson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,30]]},"reference":[{"key":"41_CR1","volume-title":"Vector Models for Data-parallel Computing","author":"G.E. Blelloch","year":"1990","unstructured":"Blelloch, G.E.: Vector Models for Data-parallel Computing MIT Press, Cambridge, MA (1990)"},{"key":"41_CR2","unstructured":"Feitelson, D.: Job Scheduling in Multiprogrammed Parallel Systems IBM Research Report RC 19970, Second Revision (1997)"},{"issue":"1","key":"41_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., Phillips, S., Torng, E., Non-clairvoyant scheduling, Theoretical Computer Science, (1994) 130(1):17\u201347","journal-title":"Theoretical Computer Science"},{"key":"41_CR4","unstructured":"Scherson, I. D., Subramaniam R., Reis, V. L. M., Campos, L. M. Scheduling Computationally Intensive Data Parallel Programs. Ecole Placement Dynamique et Re\u2019partition de charge (1996) 39\u201361"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Squillante, M. S., Wang, F., Papaefthymiou, M., An Analysis of Gang Scheduling for Multiprogrammed Parallel Computing Environments, Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, (1996) 89\u201398","DOI":"10.1145\/237502.237511"},{"key":"41_CR6","volume-title":"PhD Thesis","author":"R. Subramaniam","year":"1995","unstructured":"Subramaniam, R.: A Framework for Parallel Job Scheduling PhD Thesis, University of California at Irvine (1995)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201998 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0057875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:13:10Z","timestamp":1587341590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0057875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649526","9783540499206"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0057875","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"30 June 2006","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"}]}}