{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:44Z","timestamp":1725664604695},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616269"},{"type":"electronic","value":"9783540706335"}],"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-61626-8_52","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:05:57Z","timestamp":1330293957000},"page":"398-401","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cycle shrinking by dependence reduction"],"prefix":"10.1007","author":[{"given":"Kunio","family":"Okuda","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/0167-8191(94)90001-9","volume":"20","author":"A. Darte","year":"1994","unstructured":"Darte, A. and Robert, Y. Mapping uniform loop nests onto distributed memory architectures. Parallel Computing 20(1994) 679\u2013710.","journal-title":"Parallel Computing"},{"key":"52_CR2","unstructured":"Liu, L. S., Ho, C. W. and Sheu, J. P. On the parallelism of nested for-loops using index shift method. Proc. Internat. Conf. on Parallel Processing (Aug. 1990) II-119\u2013II-123."},{"key":"52_CR3","unstructured":"Okuda, K., Cycle shrinking by dependence reduction. Technical Report, Universidade de S\u00e3o Paulo, 1995."},{"issue":"8","key":"52_CR4","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/12.30873","volume":"38","author":"J. K. Peir","year":"1989","unstructured":"Peir, J. K. and Cytron, R., Minimum distance: a method for partitioning recurrence for multiprocessors. IEEE Trans. Comput. 38(8) (Aug. 1989) 1203\u20131211.","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"52_CR5","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1109\/12.2249","volume":"37","author":"C. D. Polychronopoulos","year":"1988","unstructured":"Polychronopoulos, C. D., Compiler optimization for enhancing parallelism and their impact on architecture design. IEEE Trans. Comput. 37(8) (Aug. 1988) 991\u20131004.","journal-title":"IEEE Trans. Comput."},{"key":"52_CR6","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/0167-8191(92)90084-K","volume":"18","author":"Y. Robert","year":"1992","unstructured":"Robert, Y. and Song, S.W., Revisiting cycle shrinking. Parallel Computing, 18(1992) 481\u2013496.","journal-title":"Parallel Computing"},{"key":"52_CR7","unstructured":"Shang, W., O'Keefe, M. T. and Fortes, J. A. B. Generalized cycle shrinking. Parallel Algorithms and VLSI Architecture II. P. Quinten and Y. Robert (editors) North Holland, 1991."}],"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\/3-540-61626-8_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:25:48Z","timestamp":1587342348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61626-8_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616269","9783540706335"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-61626-8_52","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":"8 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"}]}}