{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:54:37Z","timestamp":1718067277479},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,1,28]],"date-time":"2014-01-28T00:00:00Z","timestamp":1390867200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s11227-014-1094-0","type":"journal-article","created":{"date-parts":[[2014,1,27]],"date-time":"2014-01-27T06:32:26Z","timestamp":1390804346000},"page":"576-592","source":"Crossref","is-referenced-by-count":14,"title":["Randomized approximation scheme for resource allocation in hybrid-cloud environment"],"prefix":"10.1007","volume":"69","author":[{"given":"MohammadReza","family":"HoseinyFarahabady","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young Choon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert Y.","family":"Zomaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,28]]},"reference":[{"key":"1094_CR1","doi-asserted-by":"crossref","unstructured":"Iosup A, Jan M, Sonmez OO, Epema DHJ (2007) The characteristics and performance of groups of jobs in grids. In: Proceedings of the International European Conference on Parallel Processing, LNCS, vol 4641. Springer, pp 382\u2013393","DOI":"10.1007\/978-3-540-74466-5_42"},{"key":"1094_CR2","doi-asserted-by":"crossref","unstructured":"Minh TN, Wolters L, Epema DHJ (2010) A realistic integrated model of parallel system workloads. In: International Symposium on Cluster, Cloud the Grid, CCGRID\u201910. IEEE, pp 464\u2013473","DOI":"10.1109\/CCGRID.2010.32"},{"key":"1094_CR3","doi-asserted-by":"crossref","unstructured":"HoseinyFarahabady MR, Lee YC, Zomaya AY (2012) Non-clairvoyant assignment of bag-of-tasks applications across multiple clouds. In: PDCAT\u201912. China","DOI":"10.1109\/PDCAT.2012.101"},{"key":"1094_CR4","unstructured":"HoseinyFarahabady MR, Lee YC, Liu X, Reisi Dehkordi H, Zomaya AY (2011) Approximation algorithm for scaling outlarge-scale bag-of-tasks applicationsacross multiple clouds. The University of Sydney, Tech. Rep. 684"},{"key":"1094_CR5","doi-asserted-by":"crossref","unstructured":"Dagum P, Karp R, Luby M, Ross S (1995) An optimal algorithm for monte carlo estimation. In: Foundations of Computer Science, pp 142\u2013149","DOI":"10.1109\/SFCS.1995.492471"},{"key":"1094_CR6","volume-title":"Sobolev spaces. Pure and applied mathematics","author":"R Adams","year":"2003","unstructured":"Adams R, Fournier J (2003) Sobolev spaces. Pure and applied mathematics. Elsevier Science, Philadelphia"},{"key":"1094_CR7","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. The MIT Press, Cambridge","edition":"3"},{"key":"1094_CR8","unstructured":"Chekuri C, Khanna S (2000) A ptas for the multiple knapsack problem. In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms., SODA \u201900Society for Industrial and Applied Mathematics, Philadelphia, pp 213\u2013222"},{"key":"1094_CR9","doi-asserted-by":"crossref","unstructured":"Kellerer H, Mansini R, Pferschy U, Speranza MG (2003) An efficient fully polynomial approximation scheme for the subset-sum problem. J Comput Syst Sci 66(2) 349\u2013370. doi: 10.1016\/S0022-0000(03)00006-0","DOI":"10.1016\/S0022-0000(03)00006-0"},{"issue":"4","key":"1094_CR10","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"EL Lawler","year":"1979","unstructured":"Lawler EL (1979) Fast approximation algorithms for knapsack problems. Math Oper Res 4(4):339\u2013356","journal-title":"Math Oper Res"},{"key":"1094_CR11","doi-asserted-by":"crossref","unstructured":"Arora S, Karger D, Karpinski M (1995) Polynomial time approximation schemes for dense instances of np-hard problems. In: Proceedings of the twenty-seventh annual ACM symposium on theory of computing. ACM, Las Vegas, Nevada, USA, pp 284\u2013293. doi: 10.1145\/225058.225140","DOI":"10.1145\/225058.225140"},{"key":"1094_CR12","first-page":"1","volume-title":"ombinatorics, algorithms, probabilistic and experimental methodologies, Lecture Notes in Computer Science, vol 4614","author":"G Dsa","year":"2007","unstructured":"Dsa G (2007) The tight bound of first fit decreasing bin-packing algorithm is ffd(i)=(11\/9)opt(i)+6\/9. In: Chen B, Paterson M, Zhang G (eds) ombinatorics, algorithms, probabilistic and experimental methodologies, Lecture Notes in Computer Science, vol 4614. Springer, Berlin Heidelberg, pp 1\u201311"},{"key":"1094_CR13","doi-asserted-by":"crossref","unstructured":"Iosup A, Sonmez O, Anoep S, Epema D (2008) The performance of bags-of-tasks in large-scale distributed systems. In: International Symposium on High Performance Distributed Computing, HPDC 08, USA, pp 97\u2013108","DOI":"10.1145\/1383422.1383435"},{"key":"1094_CR14","doi-asserted-by":"crossref","unstructured":"Fujimoto N, Hagihara K (2003) Near-optimal dynamic task scheduling of independent coarse-grained tasks onto a computational grid. In: Proceedings of the International Conference on Parallel Processing, ICPP\u201903, Taiwan, pp 391\u2013398","DOI":"10.1109\/ICPP.2003.1240603"},{"issue":"6","key":"1094_CR15","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1109\/TC.2007.1042","volume":"56","author":"YC Lee","year":"2007","unstructured":"Lee YC, Zomaya AY (2007) Practical scheduling of bag-of-tasks applications on grids with dynamic resilience. IEEE Trans Comput 56(6):815\u2013825","journal-title":"IEEE Trans Comput"},{"key":"1094_CR16","doi-asserted-by":"crossref","unstructured":"Silberstein M, Sharov A, Geiger D, Schuster A (2009) Gridbot: execution of bags of tasks in multiple grids. In: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, SC\u201909. ACM","DOI":"10.1145\/1654059.1654071"},{"issue":"2","key":"1094_CR17","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/322003.322011","volume":"24","author":"OH Ibarra","year":"1977","unstructured":"Ibarra OH, Kim CE (1977) Heuristic algorithms for scheduling independent tasks on nonidentical processors. J ACM 24(2):280\u2013289","journal-title":"J ACM"},{"key":"1094_CR18","doi-asserted-by":"crossref","unstructured":"Almeida VAF, Vasconcelos IMM, \u00c1rabe JNC, Menasc\u00e9 DA (1992) Using random task graphs to investigate the potential benefits of heterogeneity in parallel systems. In: Proceedings of the ACM\/IEEE conference on Supercomputing, Supercomputing \u201992. IEEE, USA, pp 683\u2013691","DOI":"10.1109\/SUPERC.1992.236634"},{"key":"1094_CR19","doi-asserted-by":"crossref","unstructured":"Menasce D, Almeida V (1990) Cost-performance analysis of heterogeneity in supercomputer architectures. In: Proceedings of the ACM\/IEEE conference on Supercomputing, Supercomputing \u201990. IEEE, USA pp 169\u2013177","DOI":"10.1109\/SUPERC.1990.130017"},{"key":"1094_CR20","doi-asserted-by":"crossref","unstructured":"Reistad B, Gifford DK (1994) Static dependent costs for estimating execution time. In: Proceedings of the Conference on LISP and functional programming. ACM, pp 65\u201378","DOI":"10.1145\/182409.182439"},{"key":"1094_CR21","doi-asserted-by":"crossref","unstructured":"Yang J, Ahmad I, Ghafoor A (1993) Estimation of execution times on heterogeneous supercomputer architectures. In: Proceedings of International Conference on Parallel Processing, ICPP \u201993. IEEE, USA, pp 219\u2013226","DOI":"10.1109\/ICPP.1993.80"},{"key":"1094_CR22","doi-asserted-by":"crossref","unstructured":"Iverson MA, Ozguner F, Follen GJ (1996) Run-time statistical estimation of task execution times for heterogeneous distributed computing. In: Proceedings of International Symposium on High Performance Distributed Computing, HPDC \u201996. IEEE, USA, p 263","DOI":"10.1109\/HPDC.1996.546196"},{"key":"1094_CR23","doi-asserted-by":"crossref","unstructured":"de Assunccao MD, di Costanzo A, Buyya R (2009) Evaluating the cost-benefit of using cloud computing to extend the capacity of clusters. In: Proceedings of the International Symposium on High Performance, Distributed Computing, HPDC\u201909. pp 141\u2013150","DOI":"10.1145\/1551609.1551635"},{"key":"1094_CR24","first-page":"246","volume-title":"Computational Science ICCS 2008, Lecture Notes in Computer Science, vol. 5101","author":"M Othman","year":"2008","unstructured":"Othman M, Abdullah M, Ibrahim H, Subramaniam S (2008) A2dlt: Divisible load balancing model for scheduling communication-intensive grid applications. In: Bubak M, Albada G, Dongarra J, Sloot P (eds) Computational Science ICCS 2008, Lecture Notes in Computer Science, vol. 5101. Springer, New York, pp 246\u2013253"},{"key":"1094_CR25","doi-asserted-by":"crossref","unstructured":"Othman, M., Abdullah, M., Ibrahim, H., Subramaniam, S.: New optimal load allocation for scheduling divisible data grid applications. In: Gabrielle A, Jaroslaw N, Edward S, GeertDick A, Jack D, Peter SMA (eds) Computational Science ICCS 2009, Lecture Notes in Computer Science, vol. 5544. Springer, New York, pp 165\u2013174. doi: 10.1007\/978-3-642-01970-8_17","DOI":"10.1007\/978-3-642-01970-8_17"},{"key":"1094_CR26","doi-asserted-by":"crossref","unstructured":"Abdullah M, Othman M (2013) Cost-based multi-qos job scheduling using divisible load theory in cloud computing. Procedia Computer Science 18. 2013 International Conference on Computational Science. pp 928\u2013935","DOI":"10.1016\/j.procs.2013.05.258"},{"issue":"1","key":"1094_CR27","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1109\/TAES.2012.6129672","volume":"48","author":"G Iyer","year":"2012","unstructured":"Iyer G, Veeravalli B, Krishnamoorthy S (2012) On handling large-scale polynomial multiplications in compute cloud environments using divisible load paradigm. Aerosp Electron Syst IEEE Trans 48(1):820\u2013831","journal-title":"Aerosp Electron Syst IEEE Trans"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1094-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1094-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1094-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:00:15Z","timestamp":1565143215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1094-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,28]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["1094"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1094-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,28]]}}}