{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:53:51Z","timestamp":1648619631458},"reference-count":20,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s0167-739x(99)00120-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:19:59Z","timestamp":1027617599000},"page":"397-403","source":"Crossref","is-referenced-by-count":0,"title":["Mapping tasks onto nodes: a parallel local neighborhood approach"],"prefix":"10.1016","volume":"17","author":[{"given":"S.Mounir","family":"Alaoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"El-Ghazawi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Frieder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Bellachia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Bensaid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0167-739X(99)00120-X_BIB1","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\/S0167-739X(99)00120-X_BIB2","unstructured":"E. Cant\u00fa-Paz, A summary of research on parallel genetic algorithms, University of Illinois Genetic Algorithms Laboratory Technical Report, 1995."},{"key":"10.1016\/S0167-739X(99)00120-X_BIB3","unstructured":"F. Ercal, Heuristic approaches to task allocation for parallel computing, Ph.D. Thesis, Ohio State University, 1988."},{"key":"10.1016\/S0167-739X(99)00120-X_BIB4","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, H.J. Siegel, Scheduling resources in multi-user heterogeneous, computing environments with SmartNet, Proceedings of the Seventh Heterogeneous Computing Workshop (HCW\u201998), Orlando, FL, March 1998, pp. 184\u2013198.","DOI":"10.1109\/HCW.1998.666558"},{"key":"10.1016\/S0167-739X(99)00120-X_BIB5","doi-asserted-by":"crossref","unstructured":"O. Frieder, H.T. Siegelmann, On the allocation of documents in multiprocessor information retrieval systems, ACM SIGIR, October 1991.","DOI":"10.1145\/122860.122884"},{"key":"10.1016\/S0167-739X(99)00120-X_BIB6","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979."},{"key":"10.1016\/S0167-739X(99)00120-X_BIB7","unstructured":"A. Geist et al., Parallel Virtual Machines, MIT Press, Cambridge, MA, 1995."},{"key":"10.1016\/S0167-739X(99)00120-X_BIB8","unstructured":"D.E. Goldberg, Genetic Algorithms in Search Optimization and Machine Learning, Wesley, New York, 1989."},{"key":"10.1016\/S0167-739X(99)00120-X_BIB9","doi-asserted-by":"crossref","unstructured":"H. Kameda, J. Li, C. Kim, Y. Zhang, Optimal Load Balancing in Distributed Computer Systems, Springer, Berlin, 1997.","DOI":"10.1007\/978-1-4471-0969-3"},{"key":"10.1016\/S0167-739X(99)00120-X_BIB10","doi-asserted-by":"crossref","unstructured":"S.-Y. Lee, J.K. Aggarwal, A mapping strategy for parallel processing, IEEE Trans. Comput. 36 (4) 1987.","DOI":"10.1109\/TC.1987.1676925"},{"key":"10.1016\/S0167-739X(99)00120-X_BIB11","doi-asserted-by":"crossref","unstructured":"D. Levine, A parallel genetic algorithm for the set partitioning problem, Ph.D. Thesis, Illinois Institute of Technology, Chicago, IL, 1994.","DOI":"10.2172\/10161119"},{"key":"10.1016\/S0167-739X(99)00120-X_BIB12","unstructured":"V.M. Lo, Heuristic algorithms for task assignment in distributed systems, Proceedings of the Fourth International Conference on Distributed Computer Systems, May 1984, pp. 30\u201339."},{"key":"10.1016\/S0167-739X(99)00120-X_BIB13","unstructured":"N. Mansour, Physical optimization algorithms for mapping data to distributed-memory multiprocessors, Ph.D. Thesis, Syracuse University, August 1992."},{"key":"10.1016\/S0167-739X(99)00120-X_BIB14","doi-asserted-by":"crossref","unstructured":"F. Marin, O. Trelles-Salazar, F. Sandoval, Genetic algorithms on LAN message passing architectures using PVM: application to the routing problem, in: Y. Davidor, H.-P. Shwefel, R. Manner (Eds.), Parallel Problem Solving from Nature \u2014 PPSN III, Vol. 866, Lecture Notes in Computer Science, Springer, Berlin, pp. 534\u2013543.","DOI":"10.1007\/3-540-58484-6_296"},{"key":"10.1016\/S0167-739X(99)00120-X_BIB15","doi-asserted-by":"crossref","unstructured":"P. Mehra, B.W. Wah, Load Balancing: An Automated Learning Approach, World Scientific, Singapore, 1995.","DOI":"10.1142\/2631"},{"key":"10.1016\/S0167-739X(99)00120-X_BIB16","unstructured":"K. Park, O. Frieder, A. Sood, A parallel solution for the multiprocessor document allocation problem, International Parallel Processing Conference, St. Charles, IL, August 1994."},{"key":"10.1016\/S0167-739X(99)00120-X_BIB17","doi-asserted-by":"crossref","unstructured":"A. Salek, J. Lou, M. Pedram, MERLIN: semi-order-independent hierarchical buffered routing tree generation using local neighborhood search, Proceedings of the Design Automation Conference (DAC\u201999), New Orleans, LA, 1999.","DOI":"10.1145\/309847.309982"},{"key":"10.1016\/S0167-739X(99)00120-X_BIB18","unstructured":"B. Shirazi, A.R. Hurson, K.M. Kavi (Eds.), Scheduling and Load Balancing in Parallel and Distributed Systems, IEEE Computer Society Press, 1995."},{"key":"10.1016\/S0167-739X(99)00120-X_BIB19","doi-asserted-by":"crossref","unstructured":"E.-G. Talbi, P. Bessiere, Parallel genetic algorithm for the graph partitioning problem, ACM International Conference on Supercomputing, Cologne, Germany, June 1991.","DOI":"10.1145\/109025.109102"},{"key":"10.1016\/S0167-739X(99)00120-X_BIB20","doi-asserted-by":"crossref","unstructured":"M. Yannakakis, The analysis of local search problems and their heuristics, Annual Symposium on Theoretical Aspects of Computer Science (STACS\u201990), Rouen, France, February 1990.","DOI":"10.1007\/3-540-52282-4_52"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X9900120X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X9900120X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T07:33:34Z","timestamp":1578900814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X9900120X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0167739X9900120X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(99)00120-x","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}