{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:26:57Z","timestamp":1649172417508},"reference-count":30,"publisher":"Elsevier BV","issue":"8-10","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s1383-7621(03)00011-0","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T16:29:22Z","timestamp":1046795362000},"page":"267-283","source":"Crossref","is-referenced-by-count":10,"title":["Clustering and reassignment-based mapping strategy for message-passing architectures"],"prefix":"10.1016","volume":"48","author":[{"given":"Miquel A.","family":"Senar","sequence":"first","affiliation":[]},{"given":"Ana","family":"Ripoll","sequence":"additional","affiliation":[]},{"given":"Ana","family":"Cort\u00e9s","sequence":"additional","affiliation":[]},{"given":"Emilio","family":"Luque","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1383-7621(03)00011-0_BIB1","series-title":"Parallel Program Development for Cluster Computing\u2013\u2013Methodology, Tools and Integrated Environments","first-page":"69","article-title":"Dynamic load balancing","author":"Senar","year":"2001"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB2","series-title":"Computer and Intractability\u2013\u2013A Guide to the Theory of NP-Completeness, Freeman","author":"Garey","year":"1979"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/S1383-7621(96)00052-5","article-title":"Divide-and-conquer mapping of parallel programs onto hypercube computers","volume":"43","author":"Lor","year":"1997","journal-title":"Journal of Systems Architecture"},{"issue":"1","key":"10.1016\/S1383-7621(03)00011-0_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(90)90115-P","article-title":"Cluster partitioning approaches to mapping parallel problems onto a hypercube","volume":"13","author":"Sadayappan","year":"1990","journal-title":"Parallel Computing"},{"issue":"12","key":"10.1016\/S1383-7621(03)00011-0_BIB5","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":"1990","journal-title":"IEEE Transactions on Computers"},{"issue":"9","key":"10.1016\/S1383-7621(03)00011-0_BIB6","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/71.615437","article-title":"Allocating task interaction graphs to processors in heterogeneous networks","volume":"8","author":"Hui","year":"1997","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1006\/jpdc.1997.1311","article-title":"On the task assignment problem: two new efficient heuristic algorithms","volume":"42","author":"Kopidakis","year":"1997","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1006\/jpdc.1997.1360","article-title":"Global optimization for mapping parallel image processing tasks on distributed memory machines","volume":"45","author":"Lee","year":"1997","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"10.1016\/S1383-7621(03)00011-0_BIB9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1109\/71.577254","article-title":"Optimal task assignment in homogeneous networks","volume":"8","author":"Lee","year":"1997","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB10","unstructured":"T. Decker, R. Diekmann, Mapping of coarse-grained applications on workstation-clusters, in: Proceedings of Fifth Euromicro Workshop on Parallel and Distributed Processing, IEEE Computer Society Press, 1997, pp. 5\u201312"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB11","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S1383-7621(96)00022-7","article-title":"ANDES: evaluating mapping strategies with synthetic programs","volume":"42","author":"Kitajima","year":"1996","journal-title":"Journal of Systems Architecture"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB12","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/0743-7315(92)90013-D","article-title":"A new mapping heuristic based on mean field annealing","volume":"16","author":"Bultan","year":"1992","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"5","key":"10.1016\/S1383-7621(03)00011-0_BIB13","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/cpe.4330070506","article-title":"Task assignment using problem-space genetic algorithm","volume":"7","author":"Ahmad","year":"1995","journal-title":"Concurrency: Practice and Experience"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1006\/jpdc.1997.1398","article-title":"Task allocation by parallel evolutionary computing","volume":"47","author":"Schoneveld","year":"1997","journal-title":"Journal of Parallell and Distributed Computing"},{"issue":"3","key":"10.1016\/S1383-7621(03)00011-0_BIB15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/158439.158908","article-title":"Models of machines and computation for mapping in multicomputers","volume":"25","author":"Norman","year":"1993","journal-title":"ACM Computer Surveys"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB16","first-page":"151","article-title":"Mapping iterative task graphs on distributed-memory machines","author":"Yang","year":"1995","journal-title":"International Conference on Parallel Processing"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB17","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/4434.708255","article-title":"Optimal task assignment in heterogeneous distributed computing systems","author":"Kafil","year":"1998","journal-title":"IEEE Concurrency"},{"issue":"4","key":"10.1016\/S1383-7621(03)00011-0_BIB18","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1142\/S0129626495000473","article-title":"Automatic task graph generation techniques","volume":"5","author":"Cosnard","year":"1995","journal-title":"Parallel Processing Letters"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB19","series-title":"Designing and Building Parallel Programs","author":"Foster","year":"1995"},{"issue":"134","key":"10.1016\/S1383-7621(03)00011-0_BIB20","first-page":"24","article-title":"Partitioning concurrent VLSI simulation programs onto a multiprocessor by simulated annealing","author":"Shield","year":"1987","journal-title":"IEEE Proceedings Part G"},{"issue":"3","key":"10.1016\/S1383-7621(03)00011-0_BIB21","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/71.210815","article-title":"A generalized scheme for mapping parallel algorithms","volume":"4","author":"Chaudhary","year":"1993","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3","key":"10.1016\/S1383-7621(03)00011-0_BIB22","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01379319","article-title":"OREGAMI: tools for mapping parallel computations to architectures","volume":"20","author":"Lo","year":"1991","journal-title":"International Journal of Parallel Programming"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(94)90109-0","article-title":"Heuristic algorithms for task assignment and scheduling in a processor network","volume":"20","author":"Wu","year":"1994","journal-title":"Parallel Computing"},{"issue":"6","key":"10.1016\/S1383-7621(03)00011-0_BIB24","first-page":"50","article-title":"Heuristic models of task assignment scheduling in distributed systems","volume":"15","author":"Efe","year":"1982","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB25","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/0743-7315(92)90012-C","article-title":"A comparison of heuristics for scheduling directed acyclic graphs on multiprocessors","volume":"16","author":"Gerasoulis","year":"1992","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB26","unstructured":"M.A. Senar, A. Ripoll, A. Cort\u00e9s, E. Luque, An efficient clustering-based approach for mapping parallel programs, in: Proceedings of Fifth Euromicro Workshop on Parallel and Distributed Processing, IEEE Press, London, 1997, pp. 407\u2013412"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB27","doi-asserted-by":"crossref","unstructured":"M.A. Senar, A. Ripoll, A. Cort\u00e9s, E. Luque, Performance comparison of strategies for static mapping of parallel programs, in: Proceedings of HPCN Europe, LNCS, Springer-Verlag, 1997, pp. 575\u2013587","DOI":"10.1007\/BFb0031630"},{"issue":"3","key":"10.1016\/S1383-7621(03)00011-0_BIB28","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"C-30","author":"Bokhari","year":"1981","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB29","doi-asserted-by":"crossref","unstructured":"T. Yang, A. Gerasoulis, PYRROS: static task scheduling and code generation for message pasing multiprocessors, in: Proceedings of Sixth ACM International Conference on Supercomputing (ICS92), ACM Press, New York, NY, 1992, pp. 428\u2013437","DOI":"10.1145\/143369.143446"},{"key":"10.1016\/S1383-7621(03)00011-0_BIB30","doi-asserted-by":"crossref","unstructured":"C. Roig, A. Ripoll, M.A. Senar, F. Guirado, E. Luque, Exploiting knowledge of temporal behavior of parallel programs for improving distributed mapping, in: Proceedings of Sixth International Euro-Par Conference (Euro-Par2000), LNCS 1900, Springer-Verlag, 2000, pp. 262\u2013271","DOI":"10.1007\/3-540-44520-X_35"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000110?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000110?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T19:34:43Z","timestamp":1584473683000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762103000110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":30,"journal-issue":{"issue":"8-10","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S1383762103000110"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(03)00011-0","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}