{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T07:12:05Z","timestamp":1673680325344},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01245404","type":"journal-article","created":{"date-parts":[[2005,2,26]],"date-time":"2005-02-26T13:05:35Z","timestamp":1109423135000},"page":"183-202","source":"Crossref","is-referenced-by-count":7,"title":["Partitioning and mapping of nested loops for linear array multicomputers"],"prefix":"10.1007","volume":"9","author":[{"given":"Jang-Ping","family":"Sheu","sequence":"first","affiliation":[]},{"given":"Tzung-Shi","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"CR1","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TC.1979.1675434","volume":"C-28","author":"U. Bannerjee","year":"1979","unstructured":"Bannerjee, U., Chen, S.C., Kuck, D.J., and Towle, R.A. 1979. Time and parallel processor bounds for Fortran-like loops.IEEE Trans. Comps., C-28, 9(Sept.): 660?670.","journal-title":"IEEE Trans. Comps."},{"issue":"Jan.","key":"CR2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/12.75137","volume":"37","author":"S.H. Bokhari","year":"1988","unstructured":"Bokhari, S.H. 1988. Partitioning problems in parallel, pipelined, and distributed computing.IEEE Trans. Comps., 37(Jan.): 48?57.","journal-title":"IEEE Trans. Comps."},{"issue":"9","key":"CR3","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1109\/71.308531","volume":"5","author":"T.S. Chen","year":"1994","unstructured":"Chen, T.S., and Sheu, J.P. 1994. Communication-free data allocation techniques for parallelizing compilers on multicomputers.IEEE Trans. Parallel and Distr. Systems, 5, 9(Sept.): 924?938.","journal-title":"IEEE Trans. Parallel and Distr. Systems"},{"issue":"Aug.","key":"CR4","first-page":"139","volume":"2","author":"E.H. D'Hollander","year":"1989","unstructured":"D'Hollander, E.H. 1989. Partitioning and labeling of index sets in do loops with constant dependence. InProc., 1989 Internat. Conf. on Parallel Processing, vol. 2 (Aug.), pp. 139?144.","journal-title":"Proc., 1989 Internat. Conf. on Parallel Processing"},{"issue":"1","key":"CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0743-7315(90)90004-9","volume":"10","author":"F. Ercal","year":"1990","unstructured":"Ercal, F., Ramanujam, J., and Sadayappan, P. 1990. Task allocation onto a hypercube by recursive mincut bipartitioning.J. Parallel and Distr. Comp., 10, 1(Sept.): 35?44.","journal-title":"J. Parallel and Distr. Comp."},{"key":"CR6","volume-title":"Linear Algebra","author":"S.H. Friedberg","year":"1979","unstructured":"Friedberg, S.H., Insel, A.J., and Spence, L.E. 1979.Linear Algebra. Prentice-Hall, Englewood Cliffs, N.J."},{"issue":"4","key":"CR7","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/71.149968","volume":"3","author":"R. Gupta","year":"1992","unstructured":"Gupta, R. 1992. Synchronization and communication costs of loop partitioning on shared-memory multiprocessor systems.IEEE Trans. Parallel and Distr. Systems, 3, 4(July): 505?512.","journal-title":"IEEE Trans. Parallel and Distr. Systems"},{"issue":"4","key":"CR8","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1109\/71.80176","volume":"1","author":"C.T. King","year":"1990","unstructured":"King, C.T., Chou, W.H., and Ni, L.M. 1990. Pipelined data-parallel algorithms: Part II, design.IEEE Trans. Parallel and Distr. Systems, 1, 4(Oct.): 486?499.","journal-title":"IEEE Trans. Parallel and Distr. Systems"},{"key":"CR9","volume-title":"VLSI Array Processors","author":"S.Y. Kung","year":"1987","unstructured":"Kung, S.Y. 1987.VLSI Array Processors. Prentice-Hall, Englewood Cliffs, N.J."},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/360827.360844","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport, L. 1974. The parallel execution of do loops.CACM, 17, 2(Feb.): 83?93.","journal-title":"CACM"},{"issue":"Aug.","key":"CR11","first-page":"119","volume":"2","author":"L.S. Liu","year":"1990","unstructured":"Liu, L.S., Ho, C.W., and Sheu, J.P. 1990. On the parallelism of nested for-loops using index shift method. InProc., 1990 Internat. Conf. on Parallel Processing, vol. 2(Aug.), pp. 119?123.","journal-title":"Proc., 1990 Internat. Conf. on Parallel Processing"},{"issue":"Oct.","key":"CR12","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0743-7315(92)90030-Q","volume":"16","author":"M. Lu","year":"1992","unstructured":"Lu, M., and Fang, J.Z. 1992. A solution of the cache ping-pong problem in multiprocessor systems.J. Parallel and Distr. Comp., 16(Oct.): 158?171.","journal-title":"J. Parallel and Distr. Comp."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1145\/7902.7904","volume":"Dec.","author":"D.A. Padua","year":"1986","unstructured":"Padua, D.A., and Wolfe, M.J. 1986. Advanced compiler optimizations for supercomputers.CACM (Dec.): 1184?1201.","journal-title":"CACM"},{"issue":"8","key":"CR14","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/12.30873","volume":"38","author":"J.-K. Peir","year":"1989","unstructured":"Peir, J.-K., and Cytron, R. 1989. Minimum distance: A method for partitioning recurrences for multiprocessors.IEEE Trans. Comps., 38, 8(Aug.): 1203?1211.","journal-title":"IEEE Trans. Comps."},{"key":"CR15","first-page":"637","volume":"Nov.","author":"J. Ramanujam","year":"1989","unstructured":"Ramanujam, J., and Sadayappan, P. 1989. A methodology for parallelizing programs for multicomputers and complex memory multiprocessors. InProc., ACM Internat. Conf. on Supercomputing (Nov.), pp. 637?646.","journal-title":"Proc., ACM Internat. Conf. on Supercomputing"},{"key":"CR16","first-page":"23","volume":"Aug.","author":"J. Ramanujam","year":"1990","unstructured":"Ramanujam, J., and Sadayappan, P. 1990. Tiling of iteration spaces for multicomputers. InProc., 1990 Internat. Conf. on Parallel Processing (Aug.), pp. 23?36.","journal-title":"Proc., 1990 Internat. Conf. on Parallel Processing"},{"issue":"12","key":"CR17","doi-asserted-by":"crossref","first-page":"1408","DOI":"10.1109\/TC.1987.5009494","volume":"C-36","author":"P. Sadayappan","year":"1987","unstructured":"Sadayappan, P., and Ercal, F. 1987. Nearest-neighbor mapping of finite element graphs onto processor meshes.IEEE Trans. Comps., C-36, 12(Dec.): 1408?1424.","journal-title":"IEEE Trans. Comps."},{"key":"CR18","first-page":"26","volume":"Aug.","author":"W. Shang","year":"1988","unstructured":"Shang, W., and Fortes, J.A.B. 1988. Independent partitioning of algorithms with uniform dependencies. InProc., 1988 Internat. Conf. on Parallel Processing (Aug.), pp. 26?33.","journal-title":"Proc., 1988 Internat. Conf. on Parallel Processing"},{"issue":"6","key":"CR19","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1109\/12.90251","volume":"40","author":"W. Shang","year":"1991","unstructured":"Shang, W., and Fortes, J.A.B. 1991. Time optimal linear schedules for algorithms with uniform dependencies.IEEE Trans. Comps., 40, 6(June): 723?742.","journal-title":"IEEE Trans. Comps."},{"issue":"4","key":"CR20","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1109\/71.97900","volume":"2","author":"J.P. Sheu","year":"1991","unstructured":"Sheu, J.P., and Tai, T.H. 1991. Partitioning and mapping nested loops on multiprocessor systems.IEEE Trans. Parallel and Distr. Systems, 2, 4(Oct).: 430?439.","journal-title":"IEEE Trans. Parallel and Distr. Systems"},{"issue":"4","key":"CR21","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1109\/71.97902","volume":"2","author":"M.E. Wolf","year":"1991","unstructured":"Wolf, M.E., and Lam, M.S. 1991. A loop transformation theory and an algorithm to maximize parallelism.IEEE Trans. Parallel and Distr. Systems, 2, 4(Oct.): 452?471.","journal-title":"IEEE Trans. Parallel and Distr. Systems"},{"key":"CR22","first-page":"655","volume":"Nov.","author":"M.J. Wolfe","year":"1989","unstructured":"Wolfe, M.J. 1989a. More iteration space tiling. InProc., ACM Internat. Conf. on Supercomputing (Nov.), pp. 655?664.","journal-title":"Proc., ACM Internat. Conf. on Supercomputing"},{"key":"CR23","volume-title":"Optimizing Supercompilers for Supercomputers","author":"M.J. Wolfe","year":"1989","unstructured":"Wolfe, M.J. 1989b.Optimizing Supercompilers for Supercomputers. MIT Press, Cambridge, Mass."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01245404.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01245404\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01245404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:50:50Z","timestamp":1556632250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01245404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01245404"],"URL":"https:\/\/doi.org\/10.1007\/bf01245404","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}