{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:19:33Z","timestamp":1774592373871,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Autom Embed Syst"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10617-013-9119-0","type":"journal-article","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T09:03:38Z","timestamp":1378890218000},"page":"53-85","source":"Crossref","is-referenced-by-count":11,"title":["Recommendations for using Simulated Annealing in task mapping"],"prefix":"10.1007","volume":"17","author":[{"given":"Heikki","family":"Orsila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erno","family":"Salminen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"H\u00e4m\u00e4l\u00e4inen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,12]]},"reference":[{"issue":"8","key":"9119_CR1","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1016\/j.jpdc.2007.12.007","volume":"68","author":"S Ali","year":"2008","unstructured":"Ali S, Kim J-K, Siegel HJ, Maciejewski AA (2008) Static heuristics for robust resource allocation of continuously executing applications. J Parallel Distrib Comput 68(8):1070\u20131080. ISSN 0743-7315. doi: 10.1016\/j.jpdc.2007.12.007","journal-title":"J Parallel Distrib Comput"},{"issue":"8","key":"9119_CR2","first-page":"54","volume":"4","author":"DH Bailey","year":"1991","unstructured":"Bailey DH (1991) Twelve ways to fool the masses when giving performance results on parallel computers. Supercomput Rev 4(8):54\u201355. http:\/\/crd.lbl.gov\/~dhbailey\/dhbpapers\/twelve-ways.pdf","journal-title":"Supercomput Rev"},{"issue":"1","key":"9119_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"RS Barr","year":"1995","unstructured":"Barr RS, Golden BL, Kelly JP, Resende MGC, Stewart WR (1995) Designing and reporting on computational experiments with heuristic methods. Springer J Heuristics 1(1):9\u201332","journal-title":"Springer J Heuristics"},{"key":"9119_CR4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/12.76410","volume":"40","author":"SW Bollinger","year":"1991","unstructured":"Bollinger SW, Midkiff SF (1991) Heuristic technique for processor and link assignment in multicomputers. IEEE Trans Comput 40:325\u2013333","journal-title":"IEEE Trans Comput"},{"key":"9119_CR5","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1006\/jpdc.2000.1714","volume":"61","author":"TD Braun","year":"2001","unstructured":"Braun TD, Siegel HJ, Beck N (2001) A comparison of eleven static heuristics for mapping a class if independent tasks onto heterogeneous distributed systems. IEEE J Parallel Distrib Comput 61:810\u2013837","journal-title":"IEEE J Parallel Distrib Comput"},{"key":"9119_CR6","unstructured":"Coroyer C, Liu Z (1991) Effectiveness of heuristics and simulated annealing for the scheduling of concurrent tasks an empirical comparison. Rapport de recherche de l\u2019INRIA Sophia Antipolis 1379"},{"key":"9119_CR7","unstructured":"DCS task mapper (2010) A task mapping and scheduling tool for multiprocessor systems. http:\/\/wiki.tut.fi\/DACI\/DCSTaskMapper"},{"key":"9119_CR8","unstructured":"This paper\u2019s experiment data files (2012). http:\/\/zakalwe.fi\/~shd\/task-mapping\/experiment-data-2012-11.tar.gz"},{"key":"9119_CR9","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT Press, Cambridge. ISBN 0-262-04219-3","ISBN":"https:\/\/id.crossref.org\/isbn\/0262042193"},{"key":"9119_CR10","first-page":"210","volume-title":"Task allocation onto a hypercube by recursive mincut bipartitioning","author":"F Ercal","year":"1988","unstructured":"Ercal F, Ramanujam J, Sadayappan P (1988) Task allocation onto a hypercube by recursive mincut bipartitioning. ACM, New York, pp 210\u2013221. http:\/\/dl.acm.org\/citation.cfm?id=62323"},{"key":"9119_CR11","first-page":"799","volume-title":"Design automation conference (ASP-DAC), 15th","author":"F Ferrandi","year":"2010","unstructured":"Ferrandi F, Pilato C, Sciuto D, Tumeo A (2010) Mapping and scheduling of parallel C applications with ant colony optimization onto heterogeneous reconfigurable MPSoCs. In: Design automation conference (ASP-DAC), 15th, 2010, Asia and South Pacific, pp 799\u2013804"},{"issue":"2","key":"9119_CR12","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/71.127258","volume":"3","author":"M Girkar","year":"1992","unstructured":"Girkar M, Polychronopoulos CD (1992) Automatic extraction of functional parallelism from ordinary programs. IEEE Trans Parallel Distrib Syst 3(2):166\u2013178","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"9119_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0167-9260(04)00032-X","volume":"38","author":"M Gries","year":"2004","unstructured":"Gries M (2004) Methods for evaluating and covering the design space during early design development. Integr VLSI J 38(2):131\u2013183","journal-title":"Integr VLSI J"},{"key":"9119_CR14","unstructured":"Jobqueue (2010) A tool for parallelizing jobs to a cluster of computers. http:\/\/zakalwe.fi\/~shd\/foss\/jobqueue\/"},{"key":"9119_CR15","first-page":"471","volume-title":"Proceedings of IFIP Congress 74, information processing 74","author":"G Kahn","year":"1974","unstructured":"Kahn G (1974) The semantics of a simple language for parallel programming. In: Proceedings of IFIP Congress 74, information processing 74, pp 471\u2013475. http:\/\/www1.cs.columbia.edu\/~sedwards\/papers\/kahn1974semantics.pdf"},{"key":"9119_CR16","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.jpdc.2006.06.005","volume":"67","author":"J-K Kim","year":"2007","unstructured":"Kim J-K, Shivle S, Siegel HJ, Maciejewski AA, Braun TD, Schneider M, Tideman S, Chitta R, Dilmaghani RB, Joshi R, Kaul A, Sharma A, Sripada S, Vangari P, Yellampalli SS (2007) Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment. J Parallel Distrib Comput Elsevier 67:154\u2013169","journal-title":"J Parallel Distrib Comput Elsevier"},{"issue":"4598","key":"9119_CR17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"200","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 200(4598):671\u2013680","journal-title":"Science"},{"key":"9119_CR18","unstructured":"Koch P (1995) Strategies for realistic and efficient static scheduling of data independent algorithms onto multiple digital signal processors. Doctoral thesis, The DSP Research Group, Institute for Electronic Systems, Aalborg University, Aalborg, Denmark"},{"key":"9119_CR19","unstructured":"kpn-generator (2009) A program for generating random Kahn process network graphs. http:\/\/zakalwe.fi\/~shd\/foss\/kpn-generator\/"},{"key":"9119_CR20","first-page":"150","volume-title":"Proceedings of international conference on parallel processing","author":"Y-K Kwok","year":"1996","unstructured":"Kwok Y-K, Ahmad I, Gu J (1996) FAST: a low-complexity algorithm for efficient scheduling of DAGs on parallel processors. In: Proceedings of international conference on parallel processing, vol II, pp 150\u2013157"},{"issue":"2","key":"9119_CR21","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/71.752781","volume":"10","author":"Y-K Kwok","year":"1999","unstructured":"Kwok Y-K, Ahmad I (1999) FASTEST: a practical low-complexity algorithm for compile-time assignment of parallel programs to multiprocessors. IEEE Trans Parallel Distrib Syst 10(2):147\u2013159","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"9119_CR22","volume-title":"IEEE region conference on computer and communication systems","author":"F-T Lin","year":"1990","unstructured":"Lin F-T, Hsu C-C (1990) Task assignment scheduling by simulated annealing. In: IEEE region conference on computer and communication systems, Hong Kong, September 1990"},{"key":"9119_CR23","isbn-type":"print","volume-title":"Understanding and using linear programming","author":"J Matousek","year":"2006","unstructured":"Matousek J, G\u00e4rtner B (2006) Understanding and using linear programming. Springer, Berlin. ISBN 978-3540306979","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540306979"},{"key":"9119_CR24","first-page":"20","volume-title":"Proceedings of 12th IEEE international conference on distributed systems","author":"AK Nanda","year":"1992","unstructured":"Nanda AK, DeGroot D, Stenger DL (1992) Scheduling directed task graphs on multiprocessors using simulated annealing. In: Proceedings of 12th IEEE international conference on distributed systems, pp 20\u201327"},{"key":"9119_CR25","volume-title":"Optimizing algorithms for task graph mapping on multiprocessor system on chip","author":"H Orsila","year":"2011","unstructured":"Orsila H (2011) Optimizing algorithms for task graph mapping on multiprocessor system on chip. Doctoral thesis, Tampere University of Technology, Department of Computer Systems. http:\/\/dspace.cc.tut.fi\/dpub\/handle\/123456789\/20519"},{"key":"9119_CR26","first-page":"73","volume-title":"International symposium on system-on-chip","author":"H Orsila","year":"2006","unstructured":"Orsila H, Kangas T, Salminen E, H\u00e4m\u00e4l\u00e4inen TD (2006) Parameterizing simulated annealing for distributing task graphs on multiprocessor SoCs. In: International symposium on system-on-chip, Tampere, Finland, Nov 14\u201316, pp 73\u201376"},{"issue":"11","key":"9119_CR27","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.sysarc.2007.01.013","volume":"53","author":"H Orsila","year":"2007","unstructured":"Orsila H, Kangas T, Salminen E, H\u00e4nnik\u00e4inen M, H\u00e4m\u00e4l\u00e4inen TD (2007) Automated memory-aware application distribution for multi-processor system-on-chips. J Syst Archit 53(11):795\u2013815. ISSN 1383-7621","journal-title":"J Syst Archit"},{"key":"9119_CR28","volume-title":"International symposium on system-on-chip","author":"H Orsila","year":"2007","unstructured":"Orsila H, Salminen E, H\u00e4nnik\u00e4inen M, H\u00e4m\u00e4l\u00e4inen TD (2007) Optimal subset mapping and convergence evaluation of mapping algorithms for distributing task graphs on multiprocessor SoC. In: International symposium on system-on-chip, Tampere, Finland, Nov 19\u201321, 2007"},{"key":"9119_CR29","isbn-type":"print","first-page":"321","volume-title":"Simulated annealing","author":"H Orsila","year":"2008","unstructured":"Orsila H, Salminen E, H\u00e4m\u00e4l\u00e4inen TD (2008) Best practices for simulated annealing in multiprocessor task distribution problems. In: Simulated annealing, pp 321\u2013342. ISBN 978-953-7619-07-7. Chap.\u00a016, I-Tech Education and Publishing KG","ISBN":"https:\/\/id.crossref.org\/isbn\/9789537619077"},{"key":"9119_CR30","volume-title":"International symposium on system-on-chip","author":"H Orsila","year":"2009","unstructured":"Orsila H, Salminen E, H\u00e4m\u00e4l\u00e4inen TD (2009) Parameterizing simulated annealing for distributing Kahn process networks on multiprocessor SoCs. In: International symposium on system-on-chip, Tampere, Finland, Oct 5\u20137, 2009"},{"key":"9119_CR31","unstructured":"Ravindran K (2007) Task allocation and scheduling of concurrent applications to multiprocessor systems. Doctoral thesis, UCB\/EECS-2007-149. http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/2007\/EECS-2007-149.html"},{"key":"9119_CR32","unstructured":"SA+AT C reference implementation. http:\/\/zakalwe.fi\/~shd\/task-mapping"},{"key":"9119_CR33","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/581199.581224","volume-title":"Proceedings of the 15th international symposium on system synthesis","author":"M Sato","year":"2002","unstructured":"Sato M (2002) OpenMP: parallel programming API for shared memory multiprocessors and on-chip multiprocessors. In: Proceedings of the 15th international symposium on system synthesis, pp\u00a0109\u2013111. ACM, New York"},{"issue":"2","key":"9119_CR34","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/71.207593","volume":"4","author":"GC Sih","year":"1993","unstructured":"Sih GC, Lee EA (1993) A compile-time scheduling heuristics for interconnection-constrained heterogeneous processor architectures. IEEE Trans Parallel Distrib Syst 4(2):175\u2013187","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"9119_CR35","first-page":"376","volume-title":"Proc. 16th int. conference on VLSI design","author":"T Wild","year":"2003","unstructured":"Wild T, Brunnbauer W, Foag J, Pazos N (2003) Mapping and scheduling for architecture exploration of networking SoCs. In: Proc. 16th int. conference on VLSI design, pp 376\u2013381"},{"key":"9119_CR36","doi-asserted-by":"crossref","unstructured":"Wolf W (2004) The future of multiprocessor systems-on-chips. In: Design automation conference 2004, pp 681\u2013685","DOI":"10.1145\/996566.996753"},{"key":"9119_CR37","isbn-type":"print","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1109\/CAIA.1990.89181","volume-title":"Proceedings of the sixth conference on artificial intelligence applications","author":"J Xu","year":"1990","unstructured":"Xu J, Hwang K (1990) A simulated annealing method for mapping production systems onto multicomputers. In: Proceedings of the sixth conference on artificial intelligence applications. IEEE Press, New York, pp 130\u2013136. ISBN 0-8186-2032-3","ISBN":"https:\/\/id.crossref.org\/isbn\/0818620323"}],"container-title":["Design Automation for Embedded Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10617-013-9119-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10617-013-9119-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10617-013-9119-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T18:54:35Z","timestamp":1563908075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10617-013-9119-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9119"],"URL":"https:\/\/doi.org\/10.1007\/s10617-013-9119-0","relation":{},"ISSN":["0929-5585","1572-8080"],"issn-type":[{"value":"0929-5585","type":"print"},{"value":"1572-8080","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}