dc.creatorBittencourt, LF
dc.creatorMadeira, ERM
dc.date2010
dc.dateSEP
dc.date2014-11-15T17:41:14Z
dc.date2015-11-26T16:12:49Z
dc.date2014-11-15T17:41:14Z
dc.date2015-11-26T16:12:49Z
dc.date.accessioned2018-03-28T23:00:48Z
dc.date.available2018-03-28T23:00:48Z
dc.identifierJournal Of Grid Computing. Springer, v. 8, n. 3, n. 419, n. 441, 2010.
dc.identifier1570-7873
dc.identifierWOS:000281066900003
dc.identifier10.1007/s10723-009-9144-1
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/77788
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/77788
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/77788
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1267298
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionThe workflow paradigm has become the standard to represent processes and their execution flows. With the evolution of e-Science, workflows are becoming larger and more computational demanding. Such e-Science necessities match with what computational Grids have to offer. Grids are shared distributed platforms which will eventually receive multiple requisitions to execute workflows. With this, there is a demand for a scheduler which deals with multiple workflows in the same set of resources, thus the development of multiple workflow scheduling algorithms is necessary. In this paper we describe four different initial strategies for scheduling multiple workflows on Grids and evaluate them in terms of schedule length and fairness. We present results for the initial schedule and for the makespan after the execution with external load. From the results we conclude that interleaving the workflows on the Grid leads to good average makespan and provides fairness when multiple workflows share the same set of resources.
dc.description8
dc.description3
dc.description419
dc.description441
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFAPESP [05/59706-3]
dc.languageen
dc.publisherSpringer
dc.publisherDordrecht
dc.publisherHolanda
dc.relationJournal Of Grid Computing
dc.relationJ. Comput.
dc.rightsfechado
dc.rightshttp://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0
dc.sourceWeb of Science
dc.subjectGrid computing
dc.subjectWorkflow
dc.subjectScheduling
dc.subjectSystems
dc.subjectTasks
dc.subjectMiddleware
dc.subjectCluster
dc.titleTowards the Scheduling of Multiple Workflows on Computational Grids
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución