{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:44Z","timestamp":1725663944605},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540554370"},{"type":"electronic","value":"9783540470731"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55437-8_85","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:04:22Z","timestamp":1330250662000},"page":"252-265","source":"Crossref","is-referenced-by-count":0,"title":["A heuristic algorithm for dynamic task allocation in highly parallel systems"],"prefix":"10.1007","author":[{"given":"Hans-Ulrich","family":"Heiss","sequence":"first","affiliation":[]},{"given":"Rainer","family":"Wiesenfarth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"19_CR1","unstructured":"Antonelli,S.; Baiardi,F.; Pelagatti,S.; Vanneschi,M.: A Static Approach to Process Mapping in Massively Parallel Systems. Parallel Processing (1988) pp.319\u2013332."},{"key":"19_CR2","unstructured":"Baxter,J.; Patel,J.H.: The LAST Algorithm: A Heuristic-Based Static Task Allocation Algorithm. Proc. 1989 Int. Conf. on Parallel Processing, pp.II-217\u2013II-222."},{"issue":"1","key":"19_CR3","first-page":"48","volume":"37","author":"S.H. Bokhari","year":"1988","unstructured":"Bokhari, S.H.: Partitioning Problems in Parallel, Pipelined, and Distributed Computing. IEEE TOC Vol.37, 1 (Jan. 1988), pp. 48\u201357.","journal-title":"IEEE TOC"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Boillat, J.E.; Kropf,P.G.: A Fas Distributed Mapping Algorithm. CONPAR 90, pp.405\u2013416.","DOI":"10.1007\/3-540-53065-7_119"},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(89)90032-X","volume":"32","author":"M.-S. Chern","year":"1989","unstructured":"Chern,M.-S.; Chen,G.H.; Liu,P.: An LC Branch-and-Bound Algorithm for the Module Assignment Problem. Information Processing Letters 32 (1989) pp.61\u201371.","journal-title":"Information Processing Letters"},{"key":"19_CR6","volume-title":"Computer and Job-Shop-Scheduling Theory","author":"E.G. Coffman","year":"1976","unstructured":"Coffman,E.G.: Computer and Job-Shop-Scheduling Theory. John Wiley & Sons, New York, 1976."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Dussa,K.; Carlson,B.; Dowdy,L.; Park,K.-H.: Dynamic Partitioning in a Transputer Environment. ACM SIGMETRICS Conf. 1990, pp.203\u2013213.","DOI":"10.1145\/98457.98759"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0743-7315(90)90004-9","volume":"10","author":"F. Ercal","year":"1990","unstructured":"Ercal,F.; Ramanujam,J.; Sadayappan,P.: Task Allocation onto a Hypercube by Recursive Bipartitioning. Journal of Parallel and Distributed Computing 10 (1990) pp.35\u201344.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"19_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey,M.R.; Johnson,D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)."},{"issue":"3","key":"19_CR10","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1093\/comjnl\/33.3.204","volume":"33","author":"S. Gulati","year":"1990","unstructured":"Gulati, S.; Iyengar,S.S.; Barhen,J.: The Pebble Crunching Model for Faulttolerant Load Balancing in Hypercube Ensembles. The Computer Journal 33,3 (1990) pp. 204\u2013214.","journal-title":"The Computer Journal"},{"key":"19_CR11","unstructured":"Heiss, H.-U.: Classification of Task Assignment Problems in Parallel Systems. Internal Report No. 7\/91, Faculty for Informatics, University of Karlsruhe, June 1991."},{"key":"19_CR12","unstructured":"Kim,J.; Das.C.R.; Lin,W.: A Processor Allocation Scheme for Hypercube Computers. Proc. 1989 Int. Conf. on Parallel Processing, pp.II-231\u2013II-238."},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0167-8191(89)90129-4","volume":"9","author":"O. Kr\u00e4mer","year":"1988\/89","unstructured":"Kr\u00e4mer,O.; M\u00fchlenbein,H.: Mapping Strategies in Message-Based Multiprocessor Systems. Parallel Computing 9 (1988\/89), pp. 213\u2013225.","journal-title":"Parallel Computing"},{"issue":"No.11","key":"19_CR14","first-page":"1384","volume":"37","author":"V.M. Lo","year":"1988","unstructured":"Lo, V.M.: Heuristic Algorithms for Task Assignment in Distributed Systems. IEEE TOC Vol.37, No.11 (Nov. 1988) pp. 1384\u20131397.","journal-title":"IEEE TOC"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8191(90)90115-P","volume":"13","author":"P. Sadayappan","year":"1990","unstructured":"Sadayappan,P.; Ercal,F.; Ramanujam,J.: Cluster partitioning approaches to mapping parallel programs onto a hypercube. Parallel Computing, Vol.13 (1990), pp. 1\u201316.","journal-title":"Parallel Computing"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Sevcik,K.: Characterizations of Parallelisms in Applications and Their Use in Scheduling. ACM SIGMETRICS Conf., Berkeley, 1989.","DOI":"10.1145\/75108.75391"},{"key":"19_CR17","unstructured":"Wiesenfarth, R.: Design and Analysis of a Heuristic Algorithm for Dynamic Process Allocation in Highly Parallel Systems. Diploma thesis, University of Karlsruhe, Faculty for Informatics, 1990 (in German)"},{"key":"19_CR18","volume-title":"Programming Models for Parallel Systems","author":"S.A. Williams","year":"1990","unstructured":"Williams,S.A.: Programming Models for Parallel Systems. John Wiley & Sons, Chichester, 1990."}],"container-title":["Lecture Notes in Computer Science","Parallel Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55437-8_85.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:53Z","timestamp":1605646733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55437-8_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540554370","9783540470731"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-55437-8_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}