{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:15:53Z","timestamp":1756462553455},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319321516"},{"type":"electronic","value":"9783319321523"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32152-3_10","type":"book-chapter","created":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T02:10:11Z","timestamp":1459476611000},"page":"101-110","source":"Crossref","is-referenced-by-count":4,"title":["Accelerating the Min-Min Heuristic"],"prefix":"10.1007","author":[{"given":"Mart\u00edn","family":"Pedemonte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Ezzatti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1lvaro","family":"Mart\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,2]]},"reference":[{"unstructured":"Baxter, S.: Modern gpu. \n                      http:\/\/nvlabs.github.io\/moderngpu\/\n                      \n                    . Accessed April 2015","key":"10_CR1"},{"issue":"6","key":"10_CR2","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1006\/jpdc.2000.1714","volume":"61","author":"TD Braun","year":"2001","unstructured":"Braun, T.D., Siegel, H.J., Beck, N., B\u00f6l\u00f6ni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B., Hensgen, D., Freund, R.F.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J. Parallel Distrib. Comput. 61(6), 810\u2013837 (2001)","journal-title":"J. Parallel Distrib. Comput."},{"unstructured":"Canab\u00e9, M., Nesmachnow, S.: Parallel implementations of the MinMin heterogeneous computing scheduler in GPU. In: V Latin American Symposium on High Performance Computing. HPCLatam (2012). \n                      www.clei.cl\/cleiej\/papers\/v15i3p8.pdf","key":"10_CR3"},{"doi-asserted-by":"crossref","unstructured":"Diaz, C.O., Guzek, M., Pecero, J.E., Danoy, G., Bouvry, P., Khan, S.U.: Energy-aware fast scheduling heuristics in heterogeneous computing systems. In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), pp. 478\u2013484 (2011)","key":"10_CR4","DOI":"10.1109\/HPCSim.2011.5999863"},{"issue":"11","key":"10_CR5","doi-asserted-by":"publisher","first-page":"2670","DOI":"10.1016\/j.cor.2013.05.014","volume":"40","author":"P Ezzatti","year":"2013","unstructured":"Ezzatti, P., Pedemonte, M., Mart\u00edn, A.: An efficient implementation of the min-min heuristic. Comput. Oper. Res. 40(11), 2670\u20132676 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1109\/32.41334","volume":"15","author":"D Fernandez-Baca","year":"1989","unstructured":"Fernandez-Baca, D.: Allocating modules to processors in a distributed system. IEEE Trans. Softw. Eng. 15(11), 1427\u20131436 (1989)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.sysarc.2004.10.008","volume":"52","author":"A Giersch","year":"2006","unstructured":"Giersch, A., Robert, Y., Vivien, F.: Scheduling tasks sharing files on heterogeneous master-slave platforms. J. Syst. Archit. 52(2), 88\u2013104 (2006)","journal-title":"J. Syst. Archit."},{"unstructured":"Herf, M.: Radix tricks. \n                      http:\/\/stereopsis.com\/radix.html\n                      \n                    . Accessed April 2015","key":"10_CR9"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1145\/320964.320972","volume":"6","author":"P Hildebrandt","year":"1959","unstructured":"Hildebrandt, P., Isbitz, H.: Radix exchange-an internal sorting method for digital computers. J. ACM 6(2), 156\u2013163 (1959)","journal-title":"J. ACM"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/322003.322011","volume":"24","author":"OH Ibarra","year":"1977","unstructured":"Ibarra, O.H., Kim, C.E.: Heuristic algorithms for scheduling independent tasks on nonidentical processors. J. ACM 24(2), 280\u2013289 (1977)","journal-title":"J. ACM"},{"key":"10_CR12","volume-title":"The Art of Computer Programming, Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, Sorting and Searching, vol. 3, 2nd edn. Addison Wesley Longman Publishing Co., Inc., Redwood City (1998)","edition":"2"},{"issue":"6","key":"10_CR13","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.jpdc.2007.03.003","volume":"67","author":"P Luo","year":"2007","unstructured":"Luo, P., L\u00fc, K., Shi, Z.: A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems. J. Parallel Distrib. Comput. 67(6), 695\u2013714 (2007)","journal-title":"J. Parallel Distrib. Comput."},{"unstructured":"Mathworks: Multicore matlab. \n                      http:\/\/www.mathworks.com\/discovery\/multicore-matlab.html\n                      \n                    . Accessed April 2015","key":"10_CR14"},{"key":"10_CR15","volume-title":"Structured Parallel Programming: Patterns for Efficient Computation","author":"MD McCool","year":"2012","unstructured":"McCool, M.D., Robison, A.D., Reinders, J.: Structured Parallel Programming: Patterns for Efficient Computation. Morgan Kaufmann, Burlington (2012)"},{"unstructured":"Haberman, N.: Parallel neighbor sort (or the glory of the induction principle). Technical report 2087, Computer Science Department, Carnegie Mellon University (1972)","key":"10_CR16"},{"unstructured":"Nvidia Corporation: CUDA C Programming Guide Version 5.5. Nvidia Corporation (2013)","key":"10_CR17"},{"key":"10_CR18","first-page":"1","volume":"16","author":"F Pinel","year":"2012","unstructured":"Pinel, F., Dorronsoro, B., Pecero, J., Bouvry, P., Khan, S.: A two-phase heuristic for the energy-efficient scheduling of independent tasks on computational grids. Cluster Comput. 16, 1\u201313 (2012)","journal-title":"Cluster Comput."},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.jpdc.2012.02.018","volume":"73","author":"F Pinel","year":"2013","unstructured":"Pinel, F., Dorronsoro, B., Bouvry, P.: Solving very large instances of the scheduling of independent tasks problem on the GPU. J. Parallel Distrib. Comput. 73(1), 101\u2013110 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"unstructured":"Ritchie, G., Levine, J.: A fast, effective local search for scheduling independent jobs in heterogeneous computing environments. In: PLANSIG 2003: Proceedings of the 22nd Workshop of the UK Planning and Scheduling Special Interest Group, pp. 178\u2013183, December 2003","key":"10_CR20"},{"issue":"5","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1109\/TPDS.2013.107","volume":"25","author":"E Tabak","year":"2013","unstructured":"Tabak, E., Cambazoglu, B., Aykanat, C.: Improving the performance of independent task assignment heuristics minmin, maxmin and sufferage. IEEE Trans. Parallel Distrib. Syst. 25(5), 1244\u20131256 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"10_CR22","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"LG Valiant","year":"1975","unstructured":"Valiant, L.G.: Parallelism in comparison problems. SIAM J. Comput. 4(3), 348\u2013355 (1975)","journal-title":"SIAM J. Comput."},{"unstructured":"Wu, M.Y., Shu, W., Zhang, H.: Segmented min-min: A static mapping algorithm for meta-tasks on heterogeneous computing systems. In: Proceedings of the 9th Heterogeneous Computing Workshop, HCW 2000, pp. 375\u2013385. IEEE Computer Society, Washington, DC (2000)","key":"10_CR23"},{"issue":"4","key":"10_CR24","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.future.2009.11.005","volume":"26","author":"F Xhafa","year":"2010","unstructured":"Xhafa, F., Abraham, A.: Computational models and heuristic methods for grid scheduling problems. Future Gener. Comput. Syst. 26(4), 608\u2013621 (2010)","journal-title":"Future Gener. Comput. Syst."},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10852-008-9076-y","volume":"7","author":"F Xhafa","year":"2008","unstructured":"Xhafa, F., Alba, E., Dorronsoro, B., Duran, B.: Efficient batch job scheduling in grids using cellular memetic algorithms. J. Math. Model. Algorithms 7, 217\u2013236 (2008)","journal-title":"J. Math. Model. Algorithms"},{"issue":"1","key":"10_CR26","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1504\/IJWGS.2007.012635","volume":"3","author":"F Xhafa","year":"2007","unstructured":"Xhafa, F., Barolli, L., Durresi, A.: Batch mode scheduling in grid systems. Int. J. Web Grid Serv. 3(1), 19\u201337 (2007)","journal-title":"Int. J. Web Grid Serv."},{"issue":"2","key":"10_CR27","first-page":"237","volume":"28","author":"F Xhafa","year":"2009","unstructured":"Xhafa, F., Carretero, J., Dorronsoro, B., Alba, E.: A TABU search algorithm for scheduling independent jobs in computational grids. Comput. Artif. Intell. 28(2), 237\u2013250 (2009)","journal-title":"Comput. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32152-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T23:00:07Z","timestamp":1559430007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32152-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319321516","9783319321523"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32152-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}