Seite - 191 - in Algorithms for Scheduling Problems

Algorithms 2018,11, 76 7. Wieczorek,M.;Prodan,R.;Fahringer,T.Schedulingofscientificworkflowsin theaskalongridenvironment. ACMSigmodRec. 2005,34, 56–62. [CrossRef] 8. Bittencourt, L.F.;Madeira,E.R.M.Adynamicapproach for schedulingdependent taskson thexavantes gridmiddleware. InProceedingsof the4thInternationalWorkshoponMiddlewareforGridComputing, Melbourne,Australia, 27November–1December2006. 9. Jia,Y.;Rajkumar,B.Schedulingscientificworkflowapplicationswithdeadlineandbudgetconstraintsusing geneticalgorithms.Sci. Program. 2006,14, 217–230. 10. Ramakrishnan, A.; Singh, G.; Zhao, H.; Deelman, E.; Sakellariou, R.; Vahi, K.; Blackburn, K.; Meyers,D.; Samidi,M.Schedulingdata-intensiveworkflowsontostorage-constraineddistributedresources. InProceedingsof the 7th IEEESymposiumonClusterComputingand theGrid, RioDe Janeiro, Brazil, 14–17May2007. 11. Szepieniec, T.; Bubak, M. Investigation of the dag eligible jobs maximization algorithm in a grid. InProceedingsof the20089thIEEE/ACMInternationalConferenceonGridComputing,Tsukuba, Japan, 29September–1October2008. 12. Singh,G.; Su,M.-H.; Vahi,K.;Deelman,E.; Berriman,B.;Good, J.; Katz,D.S.;Mehta,G.Workflowtask clustering forbest effort systemswithPegasus. InProceedingsof the15thACMMardiGrasconference, BatonRouge,LA,USA,29 January–3February2008. 13. Singh,G.;Kesselman,C.;Deelman,E.Optimizinggrid-basedworkflowexecution. J.GridComput. 2005,3, 201–219. [CrossRef] 14. Tchernykh,A.;Lozano,L.;Schwiegelshohn,U.;Bouvry,P.;Pecero, J.-E.;Nesmachnow,S.;Drozdov,A.Online Bi-ObjectiveScheduling for IaaSCloudswithEnsuringQualityofService. J.GridComput. 2016,14, 5–22. [CrossRef] 15. Tchernykh,A.; Ecker,K.WorstCaseBehavior of ListAlgorithms forDynamic SchedulingofNon-Unit ExecutionTimeTaskswithArbitraryPrecedenceConstrains. IEICE-TranFundElec.Commun.Comput. Sci. 2008,8, 2277–2280. 16. Rodriguez,A.;Tchernykh,A.;Ecker,K.AlgorithmsforDynamicSchedulingofUnitExecutionTimeTasks. Eur. J.Oper. Res. 2003,146, 403–416. [CrossRef] 17. Tchernykh,A.;Trystram,D.;Brizuela,C.; Scherson, I. IdleRegulation inNon-ClairvoyantSchedulingof Parallel Jobs.Disc.Appl.Math. 2009,157, 364–376. [CrossRef] 18. Deelman,E.; Singh,G.; Su,M.H.; Blythe, J.;Gil,Y.;Kesselman,C.;Katz,D.S.Pegasus: A framework for mappingcomplexscientificworkflowsontodistributedsystems.Sci. Program. 2005,13, 219–237. [CrossRef] 19. Blythe, J.; Jain, S.;Deelman,E.;Vahi,K.;Gil,Y.;Mandal,A.;Kennedy,K.TaskSchedulingStrategies for Workflow-basedApplications inGrids. InProceedingsof the IEEEInternationalSymposiumonCluster ComputingandtheGrid,Cardiff,Wales,UK,9–12May2005. 20. Kliazovich, D.; Pecero, J.; Tchernykh, A.; Bouvry, P.; Khan, S.; Zomaya, A. CA-DAG: Modeling Communication-AwareApplications forScheduling inCloudComputing. J.GridComput. 2016,14, 23–39. [CrossRef] 21. Bittencourt,L.F.;Madeira,E.R.M.Towards theschedulingofmultipleworkflowsoncomputationalgrids. J.GridComput. 2010,8, 419–441. [CrossRef] 22. Zhao,H.;Sakellariou,R.Schedulingmultipledagsontoheterogeneoussystems. InProceedingsof the20th InternationalParallelandDistributedProcessingSymposium,Rhodes Island,Greece,25–29April2006. 23. Topcuouglu, H.; Hariri, S.; Wu, M.-Y. Performance-effective and low-complexity task scheduling for heterogeneouscomputing. IEEETrans. ParallelDistrib. Syst. 2002,13, 260–274. [CrossRef] 24. Sakellariou,R.;Zhao,H.Ahybridheuristic fordagschedulingonheterogeneoussystems. InProceedingsof the13th IEEEHeterogeneousComputingWorkshop,SantaFe,NM,USA,26April2004. 25. Bittencourt, L.F.; Sakellariou, R.; Madeira, E.R. DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish TimeAlgorithm. In Proceedings of the 18th Euromicro Conference on Parallel,DistributedandNetwork-BasedProcessing,Pisa, Italy,17–19February2010. 26. Zhao,H.;Sakellariou,R.AnExperimental Investigation into theRankFunctionof theHeterogeneousEarliestFinish TimeSchedulingAlgorithm; Springer: Berlin/Heidelberg,Germany,2003. 27. Pegasus.Availableonline: http://pegasus.isi.edu/workflow_gallery/index.php(accessedon15May2018). 191