{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:28:42Z","timestamp":1648668522709},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T00:00:00Z","timestamp":1385510400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s10586-013-0301-8","type":"journal-article","created":{"date-parts":[[2013,11,26]],"date-time":"2013-11-26T16:08:49Z","timestamp":1385482129000},"page":"861-870","source":"Crossref","is-referenced-by-count":3,"title":["On tradeoff between the two compromise factors in assigning tasks on a cluster computing"],"prefix":"10.1007","volume":"17","author":[{"given":"Yong Ho","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wook Jin","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung Chul","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joo Man","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,27]]},"reference":[{"key":"301_CR1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/TSE.1979.234201","volume":"SE-5","author":"S.H. Bokhari","year":"1979","unstructured":"Bokhari, S.H.: Dual process scheduling with dynamic reassignment. IEEE Trans. Softw. Eng. SE-5, 341\u2013349 (1979)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"301_CR2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TSE.1981.226469","volume":"SE-7","author":"S.H. Bokhari","year":"1981","unstructured":"Bokhari, S.H.: A shortest tree algorithm for optimal assignment across space and time in a distributed processor systems. IEEE Trans. Softw. Eng. SE-7, 583\u2013589 (1981)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"301_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2003-6","volume-title":"Assignment Problems in Parallel and Distributed Computing","author":"S.H. Bokhari","year":"1987","unstructured":"Bokhari, S.H.: Assignment Problems in Parallel and Distributed Computing. Kluwer Academic, Boston (1987)"},{"key":"301_CR4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/12.75137","volume":"C-37","author":"S.H. Bokhari","year":"1988","unstructured":"Bokhari, S.H.: Partitioning problems in parallel, pipelined and distributed computing. IEEE Trans. Comput. C-37, 48\u201357 (1988)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"301_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10586-012-0229-4","volume":"15","author":"S.Y. Chan","year":"2012","unstructured":"Chan, S.Y., Ling, T.C., Aubanel, E.: The impacr of heterogeneous multi-core clusters on graph partitioning. Clust. Comput. 15(3), 281\u2013302 (2012)","journal-title":"Clust. Comput."},{"key":"301_CR6","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/PROC.1987.13772","volume":"75","author":"W.W. Chu","year":"1987","unstructured":"Chu, W.W., Leung, K.K.: Module replication and assignment for real-time distributed processing systems. Proc. IEEE 75, 547\u2013562 (1987)","journal-title":"Proc. IEEE"},{"key":"301_CR7","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TSE.1986.6312961","volume":"SE-12","author":"D.L. Eager","year":"1986","unstructured":"Eager, D.L., Lazowska, E.D., Zahorjan, J.: Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Softw. Eng. SE-12, 662\u2013675 (1986)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"301_CR8","doi-asserted-by":"crossref","unstructured":"Efe, K.: Heuristic models of task assignment scheduling in distributed systems. IEEE Comput., 50\u201356 (1982)","DOI":"10.1109\/MC.1982.1654050"},{"key":"301_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"301_CR10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.4218\/etrij.98.0198.0402","volume":"20","author":"C.-H. Kim","year":"1998","unstructured":"Kim, C.-H., Lee, J.-M.: A repeated mapping scheme of task modules with minimum communication cost in hypercube multicomputers. ETRI J. 20(4), 327\u2013345 (1998)","journal-title":"ETRI J."},{"issue":"2","key":"301_CR11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1109\/71.577254","volume":"8","author":"C.-H. Lee","year":"1997","unstructured":"Lee, C.-H., Shin, K.G.: Optimal task assignment in homogeneous networks. IEEE Trans. Parallel Distrib. Syst. 8(2), 119\u2013129 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"301_CR12","first-page":"1384","volume":"C-37","author":"V.M. Lo","year":"1988","unstructured":"Lo, V.M.: Heuristic algorithms for task assignment in distributed systems. IEEE Trans. Comput. C-37, 1384\u20131397 (1988)","journal-title":"IEEE Trans. Comput."},{"key":"301_CR13","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10586-010-0148-1","volume":"14","author":"S. Moharil","year":"2011","unstructured":"Moharil, S., Lee, S.-Y.: Load balancing on temporally heterogeneous cluster of workstations for parallel simulated annealing. Clust. Comput. 14, 295\u2013310 (2011)","journal-title":"Clust. Comput."},{"key":"301_CR14","first-page":"482","volume-title":"Proc. 8th Int. Conf. Distributed Comput. Syst.","author":"S. Pulidas","year":"1988","unstructured":"Pulidas, S., Towsley, D., Stankovic, J.A.: Embedding gradient estimators in load balancing algorithms. In: Proc. 8th Int. Conf. Distributed Comput. Syst., pp. 482\u2013490 (1988)"},{"key":"301_CR15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10586-009-0087-x","volume":"12","author":"J. Qin","year":"2009","unstructured":"Qin, J., Bauer, M.A.: Job co-allocation strategies for multiple high performance computing clusters. Clust. Comput. 12, 323\u2013340 (2009)","journal-title":"Clust. Comput."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-013-0301-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-013-0301-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-013-0301-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T03:56:47Z","timestamp":1564891007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-013-0301-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,27]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["301"],"URL":"https:\/\/doi.org\/10.1007\/s10586-013-0301-8","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,27]]}}}