{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:16:02Z","timestamp":1736658962932,"version":"3.32.0"},"reference-count":12,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387346328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-34733-2_8","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T12:41:06Z","timestamp":1164631266000},"page":"75-84","source":"Crossref","is-referenced-by-count":2,"title":["Ant Based Heuristic for OS Service Distribution on Ad Hoc Networks"],"prefix":"10.1007","author":[{"given":"Tales","family":"Heimfarth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Janacik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"Automatic code placement alternatives for ad-hoc and sensor networks","author":"E. G. Sirer","year":"2001","unstructured":"Emin G Sirer, Rimon Barr, T. W. D Kim, and Lan Y Fung. Automatic code placement alternatives for ad-hoc and sensor networks. Technical report, Cornell University, Ithaca, NY, USA, 2001."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","volume":"SE-3","author":"H. S. Stone","year":"1977","unstructured":"H. S. Stone. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans. Software Eng., SE-3:85\u201393, 1977.","journal-title":"IEEE Trans. Software Eng."},{"issue":"11","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/12.8704","volume":"37","author":"V. M. Lo","year":"1988","unstructured":"V. M. Lo. Heuristic algorithms for task assignment in distributed systems. IEEE Trans. Comput, 37(11):1384\u20131397, 1988.","journal-title":"IEEE Trans. Comput"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"S. Ramakrishnan, I. H. Cho, and L. Dunning. A close look at task assignment in distributed systems. In In IEEE INFOCOM 91, pages 806\u2013812, Miami, 1991.","DOI":"10.1109\/INFCOM.1991.147588"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Kenjiro Taura and Andrew A. Chien. A heuristic algorithm for mapping communicating tasks on heterogeneous resources. In Heterogeneous Computing Workshop, pages 102\u2013115, 2000.","DOI":"10.1109\/HCW.2000.843736"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Nectarios Koziris, Michael Romesis, Panayiotis Tsanakas, and George Papakonstantinou. An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures. In Proc. of 8th Euromicro Workshop on Parallel and Distributed Processing (PDP2000), pages 406\u2013413, Rhodes, Greece, 2000. IEEE Press.","DOI":"10.1109\/EMPDP.2000.823437"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"M. Eshaghian and Y. Wu. Mapping heterogeneous task graphs onto heterogeneous system graphs. In Proceedings of Heterogeneous Computing Workshop, 1997.","DOI":"10.1109\/HCW.1997.581417"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"R. F. Freund, M. Gherrity, S. Ambrosius, M. Campbell, M. Halderman, D. Hensgen, E. Keith, T. Kidd, M. Kussow, J. D. Lima, F. Mirabile, L. Moore, B. Rust, and H. J. Siegel. Scheduling resources in multi-user, heterogeneous, computing environments with smartnet. In In Proceedings of Heterogeneous Computing Workshop, 1998.","DOI":"10.1109\/HCW.1998.666558"},{"key":"8_CR9","unstructured":"Christophe Lang, Michel Trehel, and Pierre Baptiste. A distributed placement algorithm based on process initiative and on a limited travel. In PDPTA, pages 2636\u20132641, 1999."},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0743-7315(90)90117-8","volume":"9","author":"S. Chowdhury","year":"1990","unstructured":"Shyamal Chowdhury. The greedy load sharing algorithm. J. Parallel Distrib. Comput, 9(1):93\u201399, 1990.","journal-title":"J. Parallel Distrib. Comput"},{"key":"8_CR11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm Intelligence: From Natural to Artificial Systems","author":"E. Bonabeau","year":"1999","unstructured":"Eric Bonabeau, Marco Dorigo, and Guy Theraulaz. Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York, NY, 1999."},{"issue":"3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sartaj Sahni and Teofilo Gonzalez. P-complete approximation problems. J. ACM, 23(3):555\u2013565, 1976.","journal-title":"J. ACM"}],"container-title":["IFIP International Federation for Information Processing","Biologically Inspired Cooperative Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-34733-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T04:39:15Z","timestamp":1736656755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-34733-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387346328"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-34733-2_8","relation":{},"subject":[]}}