{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T18:10:20Z","timestamp":1769537420996,"version":"3.49.0"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/clustr.2003.1253357","type":"proceedings-article","created":{"date-parts":[[2004,5,13]],"date-time":"2004-05-13T10:43:37Z","timestamp":1084445017000},"page":"496-499","source":"Crossref","is-referenced-by-count":14,"title":["A hierarchical and distributed approach for mapping large applications to heterogeneous grids using genetic algorithms"],"prefix":"10.1109","author":[{"family":"Sanyal","sequence":"first","affiliation":[{"name":"Dept. of Comput. Sci. & Eng., Texas Univ. at Arlington, TX, USA"}]},{"family":"Jain","sequence":"additional","affiliation":[{"name":"Dept. of Comput. Sci. & Eng., Texas Univ. at Arlington, TX, USA"}]},{"family":"Das","sequence":"additional","affiliation":[{"name":"Dept. of Comput. Sci. & Eng., Texas Univ. at Arlington, TX, USA"}]},{"family":"Biswas","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2002.1017110"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2002.1016654"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1998.669950"},{"key":"ref6","article-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"goldberg","year":"1989"},{"key":"ref5","author":"foster","year":"1999","journal-title":"The Grid Blueprint for a New Computing Infrastructure"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2002.1015564"},{"key":"ref7","article-title":"Mapping tasks to processors at run-time","author":"heiss","year":"1992","journal-title":"Intl Symp on Computer and Information Sciences"},{"key":"ref2","first-page":"18","article-title":"Architectural models for resource management in the grid","author":"buyya","year":"2000","journal-title":"Proc of the 1st Intl Workshop on Grid Computing"},{"key":"ref9","article-title":"A fast and high quality multilevel scheme for partitioning irregular graphs","author":"karypis","year":"1995","journal-title":"Tech Rep TR 95–035 Dept of Computer Science Univ of Minnesota Minneapolis MN"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1006\/jpdc.2000.1714","article-title":"A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems","volume":"61","author":"braun","year":"2001","journal-title":"J Parallel Distrib Comput"}],"event":{"name":"Proceedings. IEEE International Conference on Cluster Computing","location":"Hong Kong, China","start":{"date-parts":[[2003,12,1]]},"end":{"date-parts":[[2003,12,4]]}},"container-title":["2003 Proceedings IEEE International Conference on Cluster Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8878\/28041\/01253357.pdf?arnumber=1253357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T05:27:25Z","timestamp":1769491645000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1253357\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/clustr.2003.1253357","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}