{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T07:30:16Z","timestamp":1665041416828},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,14]],"date-time":"2014-12-14T00:00:00Z","timestamp":1418515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11227-014-1358-8","type":"journal-article","created":{"date-parts":[[2014,12,13]],"date-time":"2014-12-13T08:05:34Z","timestamp":1418457934000},"page":"1143-1162","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A novel metaheuristic algorithm and utility function for QoS based scheduling in user-centric grid systems"],"prefix":"10.1007","volume":"71","author":[{"given":"K.","family":"Kianfar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Moslehi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Yahyapour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,14]]},"reference":[{"key":"1358_CR1","doi-asserted-by":"crossref","unstructured":"Feitelson DG, Rudolph L (1995) Parallel job scheduling: issues and approaches. In: Feitelson DG, Rudolph L (eds) Job scheduling strategies for parallel processing. Lecture notes in computer science, vol 949. Springer, Berlin, pp 1\u201318","DOI":"10.1007\/3-540-60153-8_20"},{"key":"1358_CR2","doi-asserted-by":"crossref","unstructured":"Chun BN, Culler DE (2002) User-centric performance analysis of market-based cluster batch schedulers. Paper presented at the 2nd IEEE\/ACM international symposium on cluster computing and the grid","DOI":"10.1109\/CCGRID.2002.1017109"},{"key":"1358_CR3","doi-asserted-by":"crossref","unstructured":"Irwin DE, Grit LE, Chase JS (2004) Balancing risk and reward in a market-based task service. Paper presented at the 13th IEEE international symposium on high performance distributed computing","DOI":"10.1109\/HPDC.2004.1323519"},{"key":"1358_CR4","volume-title":"QoS in parallel job scheduling","author":"MK Islam","year":"2008","unstructured":"Islam MK (2008) QoS in parallel job scheduling. The Ohio State University, Columbus"},{"key":"1358_CR5","doi-asserted-by":"crossref","unstructured":"Netto MAS, Bubendorfer K, Buyya R (2007) SLA-based advance reservations with flexible and adaptive time QoS parameters. In: Kr\u00e4mer BJ , Lin K-J, Narasimhan P (eds) Service-oriented computing\u2014ICSOC. Lecture notes in computer science, vol 4749. Springer, Berlin, pp 119\u2013131","DOI":"10.1007\/978-3-540-74974-5_10"},{"key":"1358_CR6","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1002\/spe.646","volume":"35","author":"R Buyya","year":"2005","unstructured":"Buyya R, Murshed M, Abramson D, Venugopal S (2005) Scheduling parameter sweep applications on global grids: a deadline and budget constrained cost-time optimization algorithm. Softw Pract Exp 35:491\u2013512","journal-title":"Softw Pract Exp"},{"issue":"3\u20134","key":"1358_CR7","first-page":"217","volume":"14","author":"J Yu","year":"2006","unstructured":"Yu J, Buyya R (2006) Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Sci Program 14(3\u20134):217\u2013230","journal-title":"Sci Program"},{"key":"1358_CR8","doi-asserted-by":"crossref","unstructured":"Calheiros RN, Buyya R (2013) Meeting deadlines of scientific workflows in public clouds with tasks replication. IEEE Trans Parallel Distrib Syst. doi: 10.1109\/TPDS.2013.238","DOI":"10.1109\/TPDS.2013.238"},{"key":"1358_CR9","doi-asserted-by":"crossref","unstructured":"Mattess M, Calheiros RN, Buyya R (2013) Scaling mapreduce applications across hybrid clouds to meet soft deadlines. In: IEEE 27th international conference on advanced information networking and applications, Barcelona, pp 629\u2013636","DOI":"10.1109\/AINA.2013.51"},{"key":"1358_CR10","unstructured":"Calheiros RN, Buyya R (2012) Cost-effective provisioning and scheduling of deadline-constrained applications in hybrid clouds. In: Wang XS, Cruz I, Delis A, Huang G (eds) Web information systems engineering\u2014WISE. Lecture notes in computer science, vol 7651. Springer, Berlin, pp 171\u2013184"},{"issue":"2","key":"1358_CR11","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/71.80146","volume":"1","author":"K Ramamritham","year":"1990","unstructured":"Ramamritham K, Stankovic JA, Shiah P-F (1990) Efficient scheduling algorithms for real-time multiprocessor systems. IEEE Trans Parallel Distrib Syst 1(2):184\u2013194","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1358_CR12","doi-asserted-by":"crossref","unstructured":"Sherwani J, Ali N, Lotia N, Hayat Z, Buyya R (2004) Libra: a computational economy based job scheduling system for clusters. In: Software: practice and experience, vol 34. Wiley, New York, pp 573\u2013590","DOI":"10.1002\/spe.581"},{"issue":"4","key":"1358_CR13","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1177\/1094342007083776","volume":"21","author":"CS Yeo","year":"2007","unstructured":"Yeo CS, Buyya R (2007) Pricing for utility-driven resource management and allocation in clusters. Int J High Perform Comput Appl 21(4):405\u2013418","journal-title":"Int J High Perform Comput Appl"},{"key":"1358_CR14","unstructured":"Yeo CS, buyya R (2006) Managing risk of inaccurate runtime estimates for deadline constrained job admission control in clusters. In: International conference on parallel processing. IEEE Explore, Columbus, pp 451\u2013458"},{"issue":"2","key":"1358_CR15","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0743-7315(90)90028-N","volume":"10","author":"HR Arabnia","year":"1990","unstructured":"Arabnia HR (1990) A parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approach. J Parallel Distrib Comput 10(2):188\u2013193","journal-title":"J Parallel Distrib Comput"},{"key":"1358_CR16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.ipl.2006.01.002","volume":"98","author":"L Chunlin","year":"2006","unstructured":"Chunlin L, Layuan L (2006) QoS based resource scheduling by computational economy in computational grid. Inf Process Lett 98:119\u2013126","journal-title":"Inf Process Lett"},{"key":"1358_CR17","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/3-540-36133-2_6","volume":"2536","author":"A Dogan","year":"2002","unstructured":"Dogan A, Ozg\u00fcner F (2002) Scheduling independent tasks with QoS requirements in grid computing with time-varying resource prices. Lect Notes Comput Sci 2536:58\u201369","journal-title":"Lect Notes Comput Sci"},{"key":"1358_CR18","unstructured":"Golconda KS, Ozguner F, Dogan A (2004) A comparison of static QoSbased scheduling heuristics for a meta-task with multiple QoS dimensions in heterogeneous computing. In: Parallel and distributed processing symposium. IEEE Xplore"},{"key":"1358_CR19","doi-asserted-by":"crossref","unstructured":"Ernemann C (2002) Economic scheduling in grid computing. In: 8th international workshop job scheduling strategies for parallel processing. Springer, UK, pp 128\u2013152","DOI":"10.1007\/3-540-36180-4_8"},{"issue":"14","key":"1358_CR20","doi-asserted-by":"crossref","first-page":"1375","DOI":"10.1016\/j.comcom.2004.02.014","volume":"27","author":"I Foster","year":"2004","unstructured":"Foster I, Fidler M, Roy A, Sander V, Winkler L (2004) End-to-end quality of service for high-end applications. Comput Commun 27(14):1375\u20131388","journal-title":"Comput Commun"},{"key":"1358_CR21","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/978-3-540-24767-8_80","volume":"3045","author":"HS S\u00e1nchez","year":"2004","unstructured":"S\u00e1nchez HS, Sol\u00eds JF (2004) A method to establish the cooling scheme in simulated annealing like algorithms. Lect Notes Comput Sci 3045:755\u2013763","journal-title":"Lect Notes Comput Sci"},{"key":"1358_CR22","unstructured":"Feitelson DG Parallel Workloads Archive. http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload"},{"key":"1358_CR23","doi-asserted-by":"crossref","unstructured":"Yeo CS, Buyya R (2005) Service level agreement based allocation of cluster resources: handling penalty to enhance utility. Paper presented at the IEEE international cluster computing. Burlington","DOI":"10.1109\/CLUSTR.2005.347075"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1358-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1358-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1358-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T12:20:23Z","timestamp":1566130823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1358-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,14]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["1358"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1358-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,14]]}}}