{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:19:27Z","timestamp":1725455967983},"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\/bfb0024751","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:17:56Z","timestamp":1132366676000},"page":"578-581","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the cyclic scheduling problem with small communication delays"],"prefix":"10.1007","author":[{"given":"Aristotelis","family":"Giannakos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alix","family":"Munier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"74_CR1","doi-asserted-by":"crossref","unstructured":"J.Carlier and P.Chr\u00e9tienne, Timed Petri nets schedules. Advances in Petri nets, LNCS vol 340, Springer Verlag, 1988.","DOI":"10.1007\/3-540-50580-6_24"},{"issue":"No.4","key":"74_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1142\/S0129626494000363","volume":"4","author":"F. Gasperoni","year":"1994","unstructured":"F. Gasperoni, and U. Schwiegelshohn, Generating close to optimum loop schedules on parallel processors. Parallel Processing Letters, Vol. 4 No. 4 (1994):391\u2013403.","journal-title":"Parallel Processing Letters"},{"key":"74_CR3","unstructured":"A. Giannakos, J-C. K\u00f6nig, A. Munier, On the cyclic scheduling problem with small communication delays. Universit\u00e9 d'Evry-Val d'Essonne, Rapport de Recherche LaMI 10-1995, May 1995."},{"key":"74_CR4","unstructured":"C. Hanen, A. Munier, Cyclic scheduling on parallel processors: an overview. Scheduling Theory and its applications, Edited by P. Chr\u00e9tienne, E. G. Coffman Jr., J.K Lenstra and Z.Liu, John Wiley and Sons Ltd, 1995."},{"key":"74_CR5","doi-asserted-by":"crossref","unstructured":"K. Iwano, and S. Yeh, An efficient algorithm for optimal loop parallelization. International Symposium on Algorithms, LNCS Vol 450:201\u2013210, Springer Verlag, 1988.","DOI":"10.1007\/3-540-52921-7_69"},{"key":"74_CR6","unstructured":"A. Munier, C. Hanen, An approximation algorithm for scheduling unitary tasks on m processors with communication delays. Universit\u00e9 P. et M. Curie, Institut Blaise Pascal, Rapport LITP 95-12, 1995."},{"key":"74_CR7","unstructured":"A. Munier, J-C. K\u00f6nig, A Heuristic for a scheduling problem with communication delays. To appear in Oper. Res. in 1996."},{"key":"74_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0166-218X(94)00063-J","volume":"60","author":"C. Picouleau","year":"1995","unstructured":"C. Picouleau, New Complexity Results on Scheduling with Small Communication Delays. Disc. App. Maths 60:331\u2013342, 1995","journal-title":"Disc. App. Maths"},{"key":"74_CR9","series-title":"T.R. No 120","volume-title":"PhD Thesis","author":"C. Ramchandani","year":"1973","unstructured":"C. Ramchandani, Analysis of asynchronous systems by timed Petri nets. PhD Thesis, T.R. No 120, MIT Cambridge, USA, 1973."},{"issue":"4","key":"74_CR10","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1145\/321479.321485","volume":"15","author":"R. Reiter","year":"1968","unstructured":"R. Reiter, Scheduling parallel computations. Journal of the ACM 15(4):590\u2013599, October 1968.","journal-title":"Journal of the ACM"},{"key":"74_CR11","first-page":"151","volume":"II","author":"T. Yang","year":"1995","unstructured":"T. Yang, C. Fu, A. Gerasoulis, V. Sarkar, Mapping iterative task graphs on distributed memory machines. International Conference on Parallel Processing:II151\u2013158, August 1995.","journal-title":"International Conference on Parallel Processing"},{"key":"74_CR12","first-page":"130","volume":"III","author":"A. Zaky","year":"1989","unstructured":"A. Zaky, and P. Sadayappan, Optimal static scheduling of sequential loops on multiprocessors. International Conference on Parallel Processing:III130\u2013137, August 1989.","journal-title":"International Conference on Parallel Processing"}],"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\/BFb0024751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:35:22Z","timestamp":1587328522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024751"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616276","9783540706366"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0024751","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"}]}}