{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:51:53Z","timestamp":1757541113823},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0167-8191(90)90115-p","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"1-16","source":"Crossref","is-referenced-by-count":52,"title":["Cluster partitioning approaches to mapping parallel programs onto a hypercube"],"prefix":"10.1016","volume":"13","author":[{"given":"P","family":"Sadayappan","sequence":"first","affiliation":[]},{"given":"F","family":"Ercal","sequence":"additional","affiliation":[]},{"given":"J","family":"Ramanujam","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"12","key":"10.1016\/0167-8191(90)90115-P_BIB1","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1109\/12.9733","article-title":"Iterative algorithms for solution of large sparse systems of linear equations on hypercubes","volume":"37","author":"Aykanat","year":"1988","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/0167-8191(90)90115-P_BIB2","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1109\/TC.1987.1676942","article-title":"A partitioning strategy for nonuniform problems on multiprocessors","volume":"36","author":"Berger","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90115-P_BIB3","series-title":"Characteristics of Parallel Algorithms","first-page":"307","article-title":"Experience with an automatic solution to the mapping problem","author":"Berman","year":"1987"},{"issue":"3","key":"10.1016\/0167-8191(90)90115-P_BIB4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"30","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90115-P_BIB5","series-title":"Proc. 19th Design Automation Conference","first-page":"175","article-title":"A linear-time heuristic for improving network partitions","author":"Fiduccia","year":"1982"},{"key":"10.1016\/0167-8191(90)90115-P_BIB6_1","series-title":"Proc. Symposium on Parallel Computations and their Impact on Mechanics, ASME Winter Meeting","article-title":"A preprocessor for finite element problems","author":"Flower","year":"1987"},{"key":"10.1016\/0167-8191(90)90115-P_BIB6_2","author":"Flower","year":"1985","journal-title":"Caltech Concurrent Computation Project (C3P) Report-292"},{"key":"10.1016\/0167-8191(90)90115-P_BIB7","volume":"Vol. 1","author":"Fox","year":"1988"},{"issue":"3","key":"10.1016\/0167-8191(90)90115-P_BIB8","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/TSE.1986.6312889","article-title":"Optimal partitioning of randomly generated distributed programs","volume":"12","author":"Indurkhya","year":"1986","journal-title":"IEEE Trans. Software Engrg."},{"issue":"11","key":"10.1016\/0167-8191(90)90115-P_BIB9","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/TC.1984.1676376","article-title":"Practical multiprocessor scheduling algorithms for efficient parallel processing","volume":"33","author":"Kasahara","year":"1984","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0167-8191(90)90115-P_BIB10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Systems Tech. J."},{"issue":"11","key":"10.1016\/0167-8191(90)90115-P_BIB11","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/12.8704","article-title":"Heuristic algoriths for task assignment in distributed systems","volume":"37","author":"Lo","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90115-P_BIB12_1","article-title":"The scattered decomposition for finite elements","volume":"2","author":"Morison","year":"1986","journal-title":"J. Sci. Comput."},{"key":"10.1016\/0167-8191(90)90115-P_BIB12_2","author":"Morison","year":"1985","journal-title":"Caltech Concurrent Computation Project (C3P) Report-286"},{"issue":"12","key":"10.1016\/0167-8191(90)90115-P_BIB13","doi-asserted-by":"crossref","first-page":"1408","DOI":"10.1109\/TC.1987.5009494","article-title":"Nearest-neighbor mapping of finite element graphs onto processor meshes","volume":"36","author":"Sadayappan","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90115-P_BIB14","series-title":"Proc. 5th International Conference on Distributed Computing Systems","first-page":"310","article-title":"Automating resource allocation in the Cm\u2217 multiprocessor","author":"Schwan","year":"1985"},{"key":"10.1016\/0167-8191(90)90115-P_BIB15","series-title":"Hypercube Multiprocessors 1987","first-page":"141","article-title":"Mapping parallel applications on a hypercube","author":"Schwan","year":"1987"},{"issue":"3","key":"10.1016\/0167-8191(90)90115-P_BIB16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TC.1985.1676563","article-title":"A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion","volume":"34","author":"Shen","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90115-P_BIB17","series-title":"Proc. 1984 Computer Networking Symposium","first-page":"105","article-title":"Module assignment in distributed systems","author":"Sinclair","year":"1984"},{"key":"10.1016\/0167-8191(90)90115-P_BIB18","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/0743-7315(87)90024-4","article-title":"Efficient computation of optimal assignments for distributed tasks","volume":"4","author":"Sinclair","year":"1987","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090115P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090115P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:25:27Z","timestamp":1551086727000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090115P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["016781919090115P"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90115-p","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}