Yu, Jia; Buyya, Rajkumar; Ramamohanarao, Kotagiri Workflow scheduling algorithms for grid computing. (English) Zbl 1153.68345 Xhafa, Fatos (ed.) et al., Metaheuristics for scheduling in distributed computing environments. Berlin: Springer (ISBN 978-3-540-69260-7/hbk). Studies in Computational Intelligence 146, 173-214 (2008). Summary: Workflow scheduling is one of the key issues in the management of workflow execution. Scheduling is a process that maps and manages execution of inter-dependent tasks on distributed resources. It introduces allocating suitable resources to workflow tasks so that the execution can be completed to satisfy objective functions specified by users. Proper scheduling can have significant impact on the performance of the system. In this chapter, we investigate existing workflow scheduling algorithms developed and deployed by various Grid projects.For the entire collection see [Zbl 1146.90006]. Cited in 3 Documents MSC: 68M20 Performance evaluation, queueing, and scheduling in the context of computer systems Keywords:workflow scheduling; inter-dependent tasks; distributed resources; heuristics Software:ASKALON; EMan; UNICORE; ScaLAPACK PDFBibTeX XMLCite \textit{J. Yu} et al., Stud. Comput. Intell. 146, 173--214 (2008; Zbl 1153.68345) Full Text: DOI